|
Search: id:A142704
|
|
|
| A142704 |
|
A generalized factorial level recursion of a Padovan type: k=2:b(n)=b(n-1)+k; a(n)=b(n)*(a(n-2)+a(n-3)). |
|
+0
1
|
|
| 0, 1, 1, 6, 16, 70, 264, 1204, 5344, 26424, 130960, 698896, 3777216, 21576256, 125331136, 760604160, 4701036544, 30121800064, 196619065344, 1323267791104, 9069634616320
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
FORMULA
|
k=2:b(n)=b(n-1)+k; a(n)=b(n)*(a(n-2)+a(n-3)).
|
|
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 - 2] + a[n - 2]); Table[a[n], {n, 0, 20}]
|
|
CROSSREFS
|
Cf. A002467, A108189, A000931.
Sequence in context: A120795 A128243 A118640 this_sequence A083885 A009352 A056204
Adjacent sequences: A142701 A142702 A142703 this_sequence A142705 A142706 A142707
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Sep 24 2008
|
|
|
Search completed in 0.002 seconds
|
