|
Search: id:A001577
|
|
|
| A001577 |
|
An operational recurrence.
(Formerly M1718 N0681)
|
|
+0
1
|
|
| 1, 1, 2, 6, 60, 2880, 2246400, 135862272000, 10376834265907200000, 77540115374348238323712000000000
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
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 and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
H. W. Gould, Operational recurrences, Fib. Quart., 1 (No. 1, 1963), 30-33.
|
|
FORMULA
|
Product F_k^F_{n+1-k}, k=1..n, F = Fibonacci numbers.
|
|
CROSSREFS
|
Sequence in context: A156472 A108640 A084971 this_sequence A156503 A077175 A139771
Adjacent sequences: A001574 A001575 A001576 this_sequence A001578 A001579 A001580
|
|
KEYWORD
|
nice,easy,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
