login
A060820
a(n) = (2*n-1)^2 + (2*n)^2.
3
5, 25, 61, 113, 181, 265, 365, 481, 613, 761, 925, 1105, 1301, 1513, 1741, 1985, 2245, 2521, 2813, 3121, 3445, 3785, 4141, 4513, 4901, 5305, 5725, 6161, 6613, 7081, 7565, 8065, 8581, 9113, 9661, 10225, 10805, 11401, 12013, 12641, 13285, 13945, 14621, 15313
OFFSET
1,1
REFERENCES
Marilyn vos Savant and Leonore Fleischer, Brain Building in Just 12 Weeks, Bantam Books, New York, NY, 1991, pp. 104-105, 119.
FORMULA
From Colin Barker, Apr 22 2012: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: x*(5+10*x+x^2)/(1-x)^3. (End)
E.g.f.: exp(x)*(8*x^2 + 4*x + 1) - 1. - Elmo R. Oliveira, Nov 17 2025
EXAMPLE
a(1)=5 because 1^2+2^2=5.
a(2)=25 because 3^2+4^2=25.
MATHEMATICA
Table[(2*n - 1)^2 + (2*n)^2, {n, 300}] (* Vladimir Joseph Stephan Orlovsky, Feb 16 2012 *)
LinearRecurrence[{3, -3, 1}, {5, 25, 61}, 60] (* Harvey P. Dale, Oct 13 2020 *)
PROG
(PARI) a(n) = (2*n - 1)^2 + (2*n)^2 \\ Harry J. Smith, Jul 12 2009
CROSSREFS
Essentially identical to A080856, which is the main entry for this sequence. - N. J. A. Sloane, Jul 13 2025
Sequence in context: A228169 A152734 A080856 * A182211 A146404 A323187
KEYWORD
easy,nonn
AUTHOR
Jason Earls, May 05 2001
STATUS
approved