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

A240856
Number of partitions p of n into distinct parts not including 2*(number of parts).
1
0, 0, 1, 0, 0, 1, 1, 1, 0, 2, 2, 3, 3, 3, 4, 5, 6, 8, 10, 10, 13, 14, 17, 20, 24, 28, 33, 38, 44, 50, 58, 66, 76, 88, 100, 116, 132, 150, 170, 194, 219, 248, 280, 316, 358, 404, 453, 512, 574, 644, 723, 809, 904, 1010, 1128, 1258, 1404, 1563, 1738, 1934
OFFSET
0,10
FORMULA
a(n) + A240856(n) = A000009(n) for n >= 0.
EXAMPLE
a(12) = counts these 3 partitions: 84, 651, 642.
MATHEMATICA
z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; Table[Count[f[n], p_ /; MemberQ[p, 2*Length[p]]], {n, 0, z}] (* A240856 *)
CROSSREFS
Cf. A240854.
Sequence in context: A262950 A227398 A003105 * A081166 A376695 A173910
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 14 2014
STATUS
approved