|
Search: id:A056574
|
|
| |
|
| 0, 1, 1, 128, 2187, 78125, 2097152, 62748517, 1801088541, 52523350144, 1522435234375, 44231334895529, 1283918464548864, 37281334283719577, 1082404156823183753, 31427428360210000000, 912473096871571914483
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
J. Riordan, Generating functions for powers of Fibonacci numbers, Duke. Math. J. 29 (1962) 5-1.
A. Brousseau, A sequence of power formulas, Fib. Quart., 6 (1968), 81-83.
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, 1969, Vol. 1, p. 85, (exercise 1.2.8. Nr. 30) and p. 492 (solution).
|
|
FORMULA
|
a(n)= F(n)^7, F(n)=A000045(n).
G.f.: x*p(7, x)/q(7, x) with p(7, x) := sum(A056588(6, m)*x^m, m=0..6) = 1-20*x-166*x^2+318*x^3+166*x^4-20*x^5-x^6 and q(7, x) := sum(A055870(8, m)*x^m, m=0..8) = (1+x-x^2)*(1-4*x-x^2)*(1+11*x-x^2)*(1-29*x -x^2) (factorization deduced from Riordan result).
Recursion (cf. Knuth's exercise): sum(A055870(8, m)*a(n-m), m=0..8) = 0, n >= 8; inputs: a(n), n=0..7.
|
|
CROSSREFS
|
Cf. A000045, A007598, A056570-3, A056588, A055870.
Seventh row of array A103323.
Sequence in context: A113852 A046456 A092759 this_sequence A096961 A019564 A128802
Adjacent sequences: A056571 A056572 A056573 this_sequence A056575 A056576 A056577
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Jul 10 2000
|
|
|
Search completed in 0.002 seconds
|
