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

A284614
Number of partitions of n such that the (sum of distinct odd parts) > n/2.
3
1, 0, 1, 1, 3, 3, 6, 4, 8, 10, 16, 16, 26, 36, 50, 55, 82, 85, 115, 136, 190, 216, 284, 340, 467, 500, 651, 801, 1066, 1181, 1516, 1665, 2187, 2393, 3050, 3466, 4482, 5028, 6340, 6951, 8895, 9953, 12458, 13640, 17241, 19649, 24385, 26386, 33078, 36138, 44569
OFFSET
1,5
EXAMPLE
a(5) counts these 3 partitions: 5, 32, 311.
MATHEMATICA
Table[p = IntegerPartitions[n];
Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], OddQ]], {k, Length[p]}], # > n/2 &]], {n, 55}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 02 2017
STATUS
approved