|
Search: id:A053808
|
|
| |
|
| 1, 5, 15, 36, 76, 148, 273, 485, 839, 1424, 2384, 3952, 6505, 10653, 17383, 28292, 45964, 74580, 120905, 195885, 317231, 513600, 831360, 1345536, 2177521, 3523733, 5701983, 9226500, 14929324, 24156724, 39087009
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
Problem B-858 (W. Lang), Fibonacci Quarterly, 36,3 (1998) 373-374, ibid. 37,2 (1999) 183-184.
|
|
FORMULA
|
a(n)=a(n-1)+a(n-2)+(n+1)^2, a(-x)=0.
G.f.: (1+x)/((1-x-x^2)*(1-x)^3). a(n)= F(n+6)-(n^2+4*n+8), n >= 2 (see p. 184 of FQ reference)
a(n-2)=sum(i=0, n, F(i)*(n-i)^2) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 06 2004
|
|
CROSSREFS
|
Convolution of A000290 (squares) with A000045, n >= 1. (Fibonacci) - Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Apr 10 2000
Right-hand column 7 of triangle A011794.
Sequence in context: A006008 A086716 A046776 this_sequence A111926 A137609 A109818
Adjacent sequences: A053805 A053806 A053807 this_sequence A053809 A053810 A053811
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Mar 27 2000
|
|
|
Search completed in 0.002 seconds
|
