|
Search: id:A110144
|
|
|
| A110144 |
|
Terms of A110142 at positions p(n)+1, where p(n) = A000041(n) is the number of partitions of n; a(n) = A110142(p(n)+1) for n>=1, with a(0) = 1. |
|
+0
2
|
|
| 1, 2, 3, 8, 6, 48, 24, 384, 144, 3840, 1152, 46080, 11520, 645120, 138240, 10321920, 1935360, 185794560, 30965760, 3715891200, 557383680, 81749606400, 11147673600, 1961990553600, 245248819200, 51011754393600, 5885971660800
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a(2*n+1) = 2^n*n!, a(2*n+2) = 3*2^n*n! for n>0, with a(0) = 1.
|
|
PROGRAM
|
(PARI) a(n)=if(n==0, 1, if(n%2==1, 2^(n\2+1)*(n\2+1)!, 3*2^((n-1)\2)*((n-1)\2)!))
|
|
CROSSREFS
|
Cf. A110142, A110141, A000041, A000165 (double factorials).
Sequence in context: A120390 A109230 A036970 this_sequence A100836 A100805 A068800
Adjacent sequences: A110141 A110142 A110143 this_sequence A110145 A110146 A110147
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Jul 14 2005
|
|
|
Search completed in 0.002 seconds
|
