A241069 Number of partitions p of n into distinct parts such that max(p) = 4*min(p).

0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 2, 0, 0, 1, 1, 2, 1, 2, 1, 3, 4, 3, 3, 3, 4, 6, 6, 4, 6, 5, 8, 8, 9, 9, 10, 13, 11, 13, 15, 17, 20, 21, 21, 24, 25, 29, 30, 33, 35, 40, 44, 44, 49, 51, 56, 61, 66, 69, 77, 82, 91, 95, 102, 106, 116, 127, 134, 147, 157, 168, 182

Offset: 0

Author

Clark Kimberling, Apr 18 2014

Keywords

• nonn
• easy

Examples

			a(10) counts these 2 partitions:  82, 4321.
		

Crossrefs

Cf. A241035, A241063, A241272, A241273.

Programs

Mathematica

z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &];
    Table[Count[f[n], p_ /; Max[p] == 2*Min[p]], {n, 0, z}] (* A241035 *)
    Table[Count[f[n], p_ /; Max[p] == 3*Min[p]], {n, 0, z}] (* A241063 *)
    Table[Count[f[n], p_ /; Max[p] == 4*Min[p]], {n, 0, z}] (* A241069 *)
    Table[Count[f[n], p_ /; Max[p] == 5*Min[p]], {n, 0, z}] (* A241272 *)
    Table[Count[f[n], p_ /; Max[p] == 6*Min[p]], {n, 0, z}] (* A241273 *)