|
Search: id:A142703
|
|
|
| A142703 |
|
A generalized factorial level recursion of a Fibonacci type: k=2:b(n)=b(n-1)+k; a(n)=b(n)*(a(n-1)+a(n-2)). |
|
+0
1
|
|
| 1, 1, 8, 54, 496, 5500, 71952, 1084328, 18500480, 352526544, 7420540480, 171007474528, 4282272360192, 115785275702720, 3361891345761536, 104330298643927680, 3446150079670054912, 120716332862675408128
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
k=2:b(n)=b(n-1)+k; a(n)=b(n)*(a(n-1)+a(n-2)).
|
|
MATHEMATICA
|
Clear[a, b, n, k] k = 2; b[0] = 0; b[n_] := b[n] = b[n - 1] + k; a[0] = 1; a[1] = 1; a[n_] := a[n] = b[n]*(a[n - 1] + a[n - 2]); Table[a[n], {n, 0, 20}]
|
|
CROSSREFS
|
Cf. A002467, A000045.
Sequence in context: A154235 A002775 A079754 this_sequence A138403 A013499 A134825
Adjacent sequences: A142700 A142701 A142702 this_sequence A142704 A142705 A142706
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Sep 24 2008
|
|
|
Search completed in 0.002 seconds
|
