|
| |
|
|
A032145
|
|
Number of ways to partition n labeled elements into pie slices of different odd sizes.
|
|
1
|
|
|
|
1, 1, 0, 1, 4, 1, 6, 1, 64, 1009, 130, 2641, 1024, 26313, 2380, 791701, 34610944, 3279233, 147068106, 32201809, 1838416384, 584037049, 37820533300, 3098105429, 3047796018304, 282732773053601, 18988926779316
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,5
|
|
|
LINKS
|
Andrew Howroyd, Table of n, a(n) for n = 0..200
C. G. Bower, Transforms (2)
Index entries for sequences related to Lyndon words
|
|
|
FORMULA
|
"CGJ" (necklace, element, labeled) transform of 1, 0, 1, 0... (odds)
|
|
|
PROG
|
(PARI) seq(n)=[subst(serlaplace(p/y), y, 1) | p <- Vec(y-1+serlaplace(prod(k=1, ceil(n/2), 1 + x^(2*k-1)*y/(2*k-1)! + O(x*x^n))))] \\ Andrew Howroyd, Sep 11 2018
|
|
|
CROSSREFS
|
Sequence in context: A072195 A032310 A032220 * A032050 A109915 A334467
Adjacent sequences: A032142 A032143 A032144 * A032146 A032147 A032148
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Christian G. Bower
|
|
|
EXTENSIONS
|
a(0)=1 prepended by Andrew Howroyd, Sep 11 2018
|
|
|
STATUS
|
approved
|
| |
|
|
