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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105063 Define a(1)=0, a(2)=0, a(3)=8, a(4)=24 and then a(n)=66*a(n-2)+32-a(n-4) sequence such that 17*(a(n)^2)+17*a(n)+1 = a square. 0
0, 0, 8, 24, 560, 1616, 36984, 106664, 2440416, 7038240, 161030504, 464417208, 10625572880, 30644497520, 701126779608, 2022072419144, 46263741881280, 133426135166016, 3052705837384904, 8804102848537944, 201432321525522416 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(n) = a(n-1)+66*a(n-2) -66*a(n-3) -a(n-4) +a(n-5). G.f.: 8*x^3*(1+x)^2/((1-x)*(x^2-8*x-1)*(x^2+8*x-1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 13 2009]

CROSSREFS

Cf. A103200, A001090.

Sequence in context: A002268 A050893 A037025 * A166483 A132586 A103953

Adjacent sequences:  A105060 A105061 A105062 * A105064 A105065 A105066

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierre-cami(AT)bbox.fr), Apr 05 2005

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 13 2009

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 21:13 EST 2012. Contains 206085 sequences.