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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258259 Number of partitions of n into distinct parts less than or equal to n/2. 5
1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 3, 2, 5, 4, 8, 8, 13, 13, 21, 21, 31, 33, 46, 49, 67, 72, 95, 104, 134, 146, 186, 203, 253, 279, 343, 378, 461, 507, 611, 675, 806, 889, 1055, 1163, 1369, 1512, 1768, 1950, 2270, 2502, 2896, 3193, 3678, 4051, 4649, 5117, 5847 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,11
COMMENTS
Intuitively the sequence is asymptotic to A000009. a(300)/A000009(300) is approximately .997749.
LINKS
FORMULA
a(n) = [x^n] Product_{i=1..floor(n/2)} 1 + x^i.
EXAMPLE
a(9) = 1 because we have: 2+3+4.
a(10) = 3 because we have: 1+4+5, 2+3+5, 1+2+3+4.
MAPLE
b:= proc(n, i) option remember; local m; m:= i*(i+1)/2;
`if`(n>m, 0, `if`(n=m, 1, b(n, i-1)+`if`(i>n, 0, b(n-i, i-1))))
end:
a:= n-> b(n, iquo(n, 2)):
seq(a(n), n=0..60); # Alois P. Heinz, May 25 2015
MATHEMATICA
Prepend[Table[nn = n; Coefficient[Series[Product[1 + x^i, {i, 1, nn/2}], {x, 0, nn}], x^n], {n, 1, 50}], 1]
CROSSREFS
Cf. A000009.
Sequence in context: A276582 A240729 A339371 * A240182 A364311 A115297
KEYWORD
nonn
AUTHOR
Geoffrey Critzer, May 24 2015
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 June 27 04:08 EDT 2024. Contains 373727 sequences. (Running on oeis4.)