login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079291 Squares of Pell numbers. 13
0, 1, 4, 25, 144, 841, 4900, 28561, 166464, 970225, 5654884, 32959081, 192099600, 1119638521, 6525731524, 38034750625, 221682772224, 1292061882721, 7530688524100, 43892069261881, 255821727047184, 1491038293021225 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(n)*(-1)^(n+1) is the r=-4 member of the r-family of sequences S_r(n), n>=1, defined in A092184 where more information can be found.

Contribution from Johannes W. Meijer (meijgia(AT)hotmail.com), Aug 01 2010: (Start)

Binomial transform of A086346.

(End)

LINKS

Joerg Arndt, Fxtbook

T. Mansour, A note on sum of k-th power of Horadam's sequence

T. Mansour, Squaring the terms of an ell-th order linear recurrence

P. Stanica, Generating functions, weighted and non-weighted sums of powers...

Index entries for sequences related to Chebyshev polynomials.

FORMULA

G.f.: x*(1-x)/(1+x)/(1-6x+x^2). a(n)=(r^n+(1/r)^n-2*(-1)^n)/8, with r=3+sqrt(8). a(n+3)=5*a(n+2)+5*a(n+1)-a(n).

L.g.f.: 1/8*log((1+2*x+x^2)/(1-6*x+x^2)) = sum(n>=0, a(n)/n*x^n), see p.627 of the fxtbook link; special case of the following: let v(0)=0, v(1)=1, and v(n)=u*v(n-1)+v(n-2), then 1/A*log((1+2*x+x^2)/(1-(2-A)*x+x^2)) = sum(n>=0, v(n)^2/n*x^n) where A=u^2+4.  [Joerg Arndt, Apr 08 2011]

a(n+1) = sum_{k=0...n}((-1)^(n-k)*A001653(k)); e.g. 144 = -1 + 5 - 29 + 169; 25 = 1 - 5 + 29 - Charlie Marion (charliem(AT)bestweb.net), Jul 16 2003

a(n)=A000129(n)^2.

a(n)= (T(n, 3)-(-1)^n)/4 with Chebyshev's polynomials of the first kind evaluated at x=3: T(n, 3)=A001541(n)=((3+2*sqrt(2))^n + (3-2*sqrt(2))^n)/2. W. Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Oct 18 2004

a(n) = rightmost term of M^n * [1 0 0] where M = the 3 X 3 matrix [4 4 1 / 2 1 0 / 1 0 0]. a(n+1) = leftmost term. E.g. a(6) = 4900, a(5) = 841 since M^5 * [1 0 0] = [4900 2030 841]. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 31 2004

a(n) = [(-1)^(n+1)+A001109(n+1)-3*A001109(n)]/4. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007

a(n) = ( ( ( (1-Sqrt[ 2 ])^n + (1+Sqrt[ 2 ])^n) /2 )^2 + (-1)^(n+1) ) /2 - Antonio Pane (apane1(AT)spc.edu), Dec 15 2007

Limit(a(n+k)/a(k),k=infinity) = A001541(n)+2*A001109(n)*sqrt(2). - Johannes W. Meijer, Aug 01 2010

For n>0, a(2n) = a(2n-1)-a(2n-2)-2, a(2n+1) = a(2n)-a(2n-1)+2. - Charlie Marion, Sep 24 2011

MAPLE

with(combinat):seq(fibonacci(i, 2)^2, i=0..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 20 2008

CROSSREFS

Cf. A000129.

Cf. A001254, A007598.

Sequence in context: A123660 A156701 A015533 * A173612 A072221 A055846

Adjacent sequences:  A079288 A079289 A079290 * A079292 A079293 A079294

KEYWORD

easy,nonn

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Feb 08 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:18 EST 2012. Contains 206011 sequences.