|
| |
|
|
A081408
|
|
a[n]=(n+1).a[n-5], a[0]=a[1]=a[2]=a[3]=a[4]=1;.
|
|
1
| |
|
|
1, 1, 1, 1, 1, 6, 7, 8, 9, 10, 66, 84, 104, 126, 150, 1056, 1428, 1872, 2394, 3000, 22176, 31416, 43056, 57456, 75000, 576576, 848232, 1205568, 1666224, 2250000, 17873856, 27143424, 39783744, 56651616, 78750000, 643458816, 1004306688, 1511782272
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,6
|
|
|
COMMENTS
| Quintic factorial sequences are generated by single 5-order recursion and appear in unified form.
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
|
|
|
EXAMPLE
| A008548, A034323, A034300, A034301, A034325 sequences are combed together as A081408(5n+r) with r=0,1,2,3,4.
|
|
|
MATHEMATICA
| f[x_] := (x+1)*f[x-5] {f[0]=1, f[1]=1; f[2]=1; f[3]=1, f[4]=1}; Table[f[w], {w, 1, 50}]
|
|
|
PROG
| (Haskell)
a081407 n = a081408_list !! n
a081407_list = 1 : 1 : 1 : 1 : zipWith (*) [5..] a081407_list
-- Reinhard Zumkeller, Jan 05 2012
|
|
|
CROSSREFS
| Cf. A001147, A002866, A034001, A007599, A034000, A007696, A000407, A034176, A034177, A008548, A034323, A034300, A034301, A034325 [double, triple, quartic, quintic, factorial subsequences], generated together in A081405-A081408.
Sequence in context: A115840 A058368 A108613 * A143616 A005050 A120191
Adjacent sequences: A081405 A081406 A081407 * A081409 A081410 A081411
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Apr 01 2003
|
| |
|
|
