Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099372
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099372 Squares of A099371(n) (generalized Fibonacci). +0
3
0, 1, 81, 6724, 558009, 46308025, 3843008064, 318923361289, 26466795978921, 2196425142889156, 182276820063821025, 15126779640154255921, 1255340433312739420416, 104178129185317217638609 (list; graph; listen)
OFFSET

0,3

COMMENT

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

LINKS

Index entries for sequences related to Chebyshev polynomials.

FORMULA

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

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

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

a(n)= 2*(T(n, 83/2)-(-1)^n)/85 with twice the Chebyshev's polynomials of the first kind: 2*T(n, 83/2)=A099373(n).

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

a(n)=-(2/85)*(-1)^n+(1/85)*[83/2+(9/2)*sqrt(85)]^n+(1/85)*[83/2-(9/2)*sqrt(85)]^n, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Aug 28 2008]

CROSSREFS

Adjacent sequences: A099369 A099370 A099371 this_sequence A099373 A099374 A099375

Sequence in context: A036354 A016948 A089683 this_sequence A036515 A046172 A123847

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research