This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032264 Number of ways to partition n labeled elements into pie slices of odd sizes allowing the pie to be turned over. 1

%I

%S 1,1,1,2,7,23,136,872,6952,62813,641536,7277342,90825472,1236592403,

%T 18239374336,289719603812,4930706056192,89509486108793,

%U 1726465695809536,35259035421020282,760088211047514112,17247810060070731983,410954011551070683136,10257838886120978286752

%N Number of ways to partition n labeled elements into pie slices of odd sizes allowing the pie to be turned over.

%H Andrew Howroyd, <a href="/A032264/b032264.txt">Table of n, a(n) for n = 0..200</a>

%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>

%F "DIJ" (bracelet, indistinct, labeled) transform of 1, 0, 1, 0, ... (odds).

%F E.g.f.: 1 + (g(x) + g(x)^2/2 - log(1-g(x)))/2 where g(x) = sinh(x). - _Andrew Howroyd_, Sep 12 2018

%o (PARI) seq(n)={my(p=sinh(x + O(x*x^n))); Vec(1 + serlaplace(p + p^2/2 - log(1-p))/2)} \\ _Andrew Howroyd_, Sep 12 2018

%K nonn

%O 0,4

%A _Christian G. Bower_

%E a(0)=1 prepended and terms a(21) and beyond from _Andrew Howroyd_, Sep 12 2018

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

Last modified January 19 20:01 EST 2019. Contains 319309 sequences. (Running on oeis4.)