|
|
A240212
|
|
Number of partitions p of n such that median(p) < multiplicity(min(p)).
|
|
5
|
|
|
0, 0, 1, 1, 2, 3, 6, 7, 10, 14, 19, 26, 37, 48, 65, 87, 115, 150, 194, 250, 322, 407, 518, 653, 823, 1029, 1287, 1598, 1984, 2449, 3021, 3706, 4540, 5540, 6752, 8197, 9933, 12004, 14482, 17421, 20924, 25070, 29992, 35797, 42661, 50735, 60254, 71421, 84536
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(8) counts these 10 partitions: 611, 5111, 4211, 41111, 32111, 311111, 2222, 221111, 2111111, 11111111.
|
|
MATHEMATICA
|
z = 40; f[n_] := f[n] = IntegerPartitions[n]; t1 = Table[Count[f[n], p_ /; Median[p] < Count[p, Min[p]]], {n, 0, z}] (* A240212 *)
t2 = Table[Count[f[n], p_ /; Median[p] <= Count[p, Min[p]]], {n, 0, z}] (* A240213 *)
t3 = Table[Count[f[n], p_ /; Median[p] == Count[p, Min[p]]], {n, 0, z}] (* A240214 *)
t4 = Table[Count[f[n], p_ /; Median[p] > Count[p, Min[p]]], {n, 0, z}] (* A240215 *)
t5 = Table[Count[f[n], p_ /; Median[p] >= Count[p, Min[p]]], {n, 0, z}] (* A240216 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|