|
|
A001577
|
|
An operational recurrence.
(Formerly M1718 N0681)
|
|
0
|
|
|
1, 1, 2, 6, 60, 2880, 2246400, 135862272000, 10376834265907200000, 77540115374348238323712000000000, 71611262431705169979126571320506685849600000000000000, 799595359352229378487949660335170674324575940302246074414582988800000000000000000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Considers recurrences u(n+1) = (d/dx) u_n(x)*u_{n-1}(x) and u(n+1) = x*(d/dx) u_n(x)*u_{n-1}(x). In latter, take u_0=1, u_1=x; setting x=1 gives sequence shown here.
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
Product F_k^F_{n+1-k}, k=1..n, F = Fibonacci numbers.
|
|
MATHEMATICA
|
Table[Product[Fibonacci[k]^Fibonacci[n+1-k], {k, n}], {n, 12}] (* Harvey P. Dale, May 16 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nice,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|