login
This site is supported by donations to The OEIS Foundation.

 

Logo


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
1, 1, 1, 2, 7, 23, 136, 872, 6952, 62813, 641536, 7277342, 90825472, 1236592403, 18239374336, 289719603812, 4930706056192, 89509486108793, 1726465695809536, 35259035421020282, 760088211047514112, 17247810060070731983, 410954011551070683136, 10257838886120978286752 (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

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

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

PROG

(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

CROSSREFS

Sequence in context: A000903 A049021 A002494 * A139522 A163158 A171130

Adjacent sequences:  A032261 A032262 A032263 * A032265 A032266 A032267

KEYWORD

nonn

AUTHOR

Christian G. Bower

EXTENSIONS

a(0)=1 prepended and terms a(21) and beyond from Andrew Howroyd, Sep 12 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 16:06 EDT 2018. Contains 316390 sequences. (Running on oeis4.)