|
Search: id:A066259
|
|
|
| A066259 |
|
Fibonacci(n)*Fibonacci(n+1)^2. |
|
+0
5
|
|
| 1, 4, 18, 75, 320, 1352, 5733, 24276, 102850, 435655, 1845504, 7817616, 33116057, 140281700, 594243090, 2517253683, 10663258432, 45170286424, 191344405725, 810547906740, 3433536036866, 14544692047439, 61612304237568
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
D. Zeitlin, Generating Functions for Products of Recursive Sequences, Transactions A.M.S., 116, Apr. 1965, p. 304.
|
|
FORMULA
|
O.g.f.: (x+x^2)/(1-3x-6x^2+3x^3+x^4).
a(n) = second term from left in M^n * [1 0 0 0] where M = the 4 X 4 upper triangular Pascal's triangle matrix [1 3 3 1 / 1 2 1 0 / 1 1 0 0 / 1 0 0 0]. E.g. a(4) = 75 since M^4 * [1 0 0 0} = [125 75 45 27] = [A056570(5) a(4) A066258(3) A056570(4)]. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 31 2004
a(n) = (1/5) {F(3n+2) - (-1)^nF(n-1) }. - Ralf Stephan, Jul 26 2005
|
|
CROSSREFS
|
Cf. A065563, A066258, A000045.
Cf. A056570, A066259.
Sequence in context: A069008 A026560 A037674 this_sequence A084213 A048664 A108012
Adjacent sequences: A066256 A066257 A066258 this_sequence A066260 A066261 A066262
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Len Smiley (smiley(AT)math.uaa.alaska.edu), Dec 09 2001
|
|
|
Search completed in 0.002 seconds
|
