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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161240 Number of partitions of n into central binomian coefficients A001405 where every part appears at least 1 times 1
1, 2, 3, 4, 5, 8, 9, 12, 15, 19, 22, 29, 33, 40, 47, 56, 63, 76, 85, 100, 113, 131, 146, 169, 187, 214, 237, 268, 295, 334, 365, 410, 449, 499, 545, 606, 657, 727, 789, 868, 940, 1033, 1114, 1219, 1315, 1433, 1542, 1678, 1800, 1954, 2095, 2266, 2426, 2619, 2798 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

R. H. Hardin, Table of n, a(n) for n=1..1000

FORMULA

G.f.=-1+1/Product(1-x*binom(j,floor(j/2)), j=1..infinity). [From Emeric Deutsch, Jun 21 2009]

EXAMPLE

a(6)=8 because we have 6, 33, 321, 3111, 222, 2211, 21111, and 111111. [From Emeric Deutsch, Jun 21 2009]

MAPLE

g := -1+1/(product(1-x^binomial(j, floor((1/2)*j)), j = 1 .. 15)): gser := series(g, x = 0, 63): seq(coeff(gser, x, n), n = 1 .. 55); [From Emeric Deutsch, Jun 21 2009]

CROSSREFS

Sequence in context: A029000 A042962 A027584 * A165652 A191851 A063678

Adjacent sequences:  A161237 A161238 A161239 * A161241 A161242 A161243

KEYWORD

nonn

AUTHOR

R. H. Hardin Jun 06 2009

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 16 21:59 EST 2019. Contains 320200 sequences. (Running on oeis4.)