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!)
A210249 Number of partitions of n in which all parts are less than n/2. 5
1, 0, 0, 1, 1, 3, 4, 8, 10, 18, 23, 37, 47, 71, 90, 131, 164, 230, 288, 393, 488, 653, 807, 1060, 1303, 1686, 2063, 2637, 3210, 4057, 4920, 6158, 7434, 9228, 11098, 13671, 16380, 20040, 23928, 29098, 34624, 41869, 49668, 59755, 70667, 84626, 99795, 118991 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
Also, a(n) gives the number of partitions of 2*n in which all parts are even and less than n.
Is this the same as A233771, or 1 together with A233771? - Omar E. Pol, Jan 18 2014
LINKS
EXAMPLE
a(7) = 8, because 3+3+1 = 3+2+2 = 3+2+1+1 = 3+1+1+1+1 = 2+2+2+1 = 2+2+1+1+1 = 2+1+1+1+1+1 = 1+1+1+1+1+1+1, exhausting the partitions of the indicated class for n=7.
MAPLE
b:= proc(n, i) option remember;
if n=0 then 1
elif i<1 then 0
else b(n, i-1) +`if`(i>n, 0, b(n-i, i))
fi
end:
a:= n-> b(n, ceil(n/2)-1):
seq (a(n), n=0..50); # Alois P. Heinz, Mar 19 2012
MATHEMATICA
b[n_, i_] := b[n, i] = If[n==0, 1, If[i<1, 0, b[n, i-1] + If[i>n, 0, b[n-i, i]]]]; a[n_] := b[n, Ceiling[n/2]-1]; Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Jan 09 2016, after Alois P. Heinz *)
CROSSREFS
Row sums of triangle A124278, for n >= 3.
Sequence in context: A263982 A326531 A326636 * A233771 A072606 A098764
KEYWORD
nonn
AUTHOR
L. Edson Jeffery, Mar 19 2012
EXTENSIONS
More terms from Alois P. Heinz, Mar 19 2012
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 April 24 18:05 EDT 2024. Contains 371962 sequences. (Running on oeis4.)