Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099369
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099369 Squares of A041025(n-1), n>=1, (generalized Fibonacci). +0
2
0, 1, 64, 4225, 278784, 18395521, 1213825600, 80094094081, 5284996383744, 348729667233025, 23010873040995904, 1518368891038496641, 100189335935499782400, 6610977802851947141761, 436224345652293011573824 (list; graph; listen)
OFFSET

0,3

COMMENT

See the comment in A099279. This is example a=8.

LINKS

Index entries for sequences related to Chebyshev polynomials.

FORMULA

a(n)= A041025(n-1)^2, n>=1, a(0)=0.

a(n)= 65*a(n-1) + 65*a(n-2) - a(n-3), n>=3; a(0)=0, a(1)=1, a(2)=64.

a(n)= 66*a(n-1) - a(n-2) - 2*(-1)^n, n>=2; a(0)=0, a(1)=1.

a(n)= (T(n, 33)-(-1)^n)/34 with the Chebyshev's polynomials of the first kind: T(n, 33)=A099370(n).

G.f.: x*(1-x)/((1-66*x+x^2)*(1+x)) = x*(1-x)/(1-65*x-65*x^2+x^3).

a(n)=-(1/34)*(-1)^n+(1/68)*[33+8*sqrt(17)]^n+(1/68)*[33-8*sqrt(17)]^n, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Aug 28 2008]

CROSSREFS

Sequence in context: A016746 A089357 A144320 this_sequence A146496 A058874 A067821

Adjacent sequences: A099366 A099367 A099368 this_sequence A099370 A099371 A099372

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Oct 18 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research