login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A238627
Number of partitions p of n such that max(p) - 3*min(p) is a part of p.
1
0, 0, 0, 0, 1, 1, 2, 4, 6, 10, 13, 20, 27, 39, 50, 70, 87, 120, 147, 198, 240, 315, 381, 491, 594, 752, 900, 1130, 1348, 1676, 1992, 2449, 2902, 3540, 4184, 5065, 5969, 7181, 8438, 10095, 11829, 14078, 16460, 19495, 22740, 26818, 31205, 36662, 42571, 49836
OFFSET
1,7
EXAMPLE
a(8) counts these partitions: 521, 431, 4211, 41111.
MATHEMATICA
Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Max[p] - 3*Min[p]]], {n, 50}]
CROSSREFS
Cf. A238626.
Sequence in context: A140652 A007981 A258847 * A336415 A241821 A280862
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Mar 02 2014
STATUS
approved