login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032219 Number of ways to partition n labeled elements into pie slices of different sizes allowing the pie to be turned over. 1
1, 1, 1, 4, 5, 16, 82, 169, 541, 2272, 43166, 99859, 479030, 2089751, 13714261, 493866559, 1397727901, 7786145776, 39662742502, 252997758007, 2026338881050, 131040136520017, 427809641611111, 2813929521468817 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Andrew Howroyd, Table of n, a(n) for n = 0..200

C. G. Bower, Transforms (2)

FORMULA

"DGJ" (bracelet, element, labeled) transform of 1, 1, 1, 1...

PROG

(PARI) seq(n)=[subst(serlaplace(p/y + polcoeff(p, 1) + polcoeff(p, 2)), y, 1)/2 | p <- Vec(y-1+serlaplace(prod(k=1, n, (1 + x^k*y/k! + O(x*x^n)))))] \\ Andrew Howroyd, Sep 11 2018

CROSSREFS

Sequence in context: A013628 A127007 A007837 * A032144 A032049 A258063

Adjacent sequences: A032216 A032217 A032218 * A032220 A032221 A032222

KEYWORD

nonn

AUTHOR

Christian G. Bower

EXTENSIONS

a(0)=1 prepended by Andrew Howroyd, Sep 11 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 14:12 EST 2022. Contains 358362 sequences. (Running on oeis4.)