|
Search: id:A161779
|
|
|
| A161779 |
|
The sequence of factorials convolved with all its regularly "aerated" variants. |
|
+0
2
|
|
| 1, 1, 3, 8, 30, 133, 768, 5221, 41302, 369170, 3677058, 40338310, 483134179, 6271796072, 87709287104, 1314511438945, 21017751750506, 357102350816602, 6424883282375340, 122025874117476166, 2439726373093186274, 51220112287152570828, 1126575412217509969515
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Convolve A000142 = 1,1,2,6,24,... with 1,0,1,0,2,0,6,0,24,.. and with
1,0,0,1,0,0,2,0,0,6,0,0,24,0,0,.. and with 1,0,0,0,1,0,0,0,2,0,0,0,6,... etc. ad infinitum.
|
|
FORMULA
|
Convergent of the infinite product (1,1,2,6,24,...)*(1,0,1,0,2,0,6,0,24,...)*(1,0,0,1,0,0,2,0,0,6,0,0,24,...)*...
a(n)=A096161(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 26 2009]
|
|
EXAMPLE
|
Let the partial products = a, a*b, a*b*c,..., with the first few rows =
(1, 1, 2, 6, 24, 120,...) = a
(1, 1, 3, 7, 28, 128,...) = a*b
(1, 1, 3, 8, 29, 131,...) = a*b*c
(1, 1, 3, 8, 30, 132,...) = a*b*c*d
...converging to A161779
|
|
MAPLE
|
read("transforms3") ; read("transforms") ; A161779 := proc(N) local a000142, res, n, j ; a000142 := [seq(n!, n=0..N)] ; res := [seq(op(n, a000142), n=1..N)] ; for j from 1 to N do res := CONV( res, AERATE(a000142, j)) ; od: [seq(op(n, res), n=1..N)] end: A161779(30) ; # R. J. Mathar, Jun 23 2009
|
|
CROSSREFS
|
A000120
Sequence in context: A151440 A162560 A096161 this_sequence A074501 A009123 A066764
Adjacent sequences: A161776 A161777 A161778 this_sequence A161780 A161781 A161782
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 19 2009
|
|
EXTENSIONS
|
Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 23 2009
|
|
|
Search completed in 0.002 seconds
|
