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”).

A238543
Number of partitions p of n such that 3*min(p) + (number of parts of p) is not a part of p.
0
1, 2, 3, 5, 7, 10, 15, 21, 29, 39, 54, 73, 96, 126, 167, 217, 281, 359, 461, 587, 744, 935, 1176, 1470, 1832, 2271, 2814, 3465, 4262, 5219, 6383, 7777, 9456, 11458, 13869, 16733, 20155, 24208, 29040, 34743, 41508, 49473, 58886, 69944, 82964, 98208, 116113
OFFSET
1,2
FORMULA
a(n) + A097092(n) = A000041(n).
EXAMPLE
a(10) counts all the 42 partitions of 10 except these: 82, 7111, 631.
MATHEMATICA
Table[Count[IntegerPartitions[n], p_ /; ! MemberQ[p, Length[p] + 3*Min[p]]], {n, 50}]
CROSSREFS
Cf. A097092.
Sequence in context: A321176 A240573 A160571 * A184641 A225490 A076972
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 28 2014
STATUS
approved