OFFSET
0,5
COMMENTS
Also the number of partitions p of n such that min(p) = min(conjugate(p)). Example:a(7) counts these 7 partitions: 61, 511, 421, 4111, 3211, 31111, 211111, of which the respective conjugates are 211111, 31111, 3211, 4111, 421, 511, 61. - Clark Kimberling, Apr 11 2014
EXAMPLE
a(6) counts these 5 partitions: 51, 411, 321, 3111, 21111.
MATHEMATICA
z = 60; f[n_] := f[n] = IntegerPartitions[n];
Table[Count[f[n], p_ /; Min[p] < Count[p, Max[p]]], {n, 0, z}] (* A240178 *)
Table[Count[f[n], p_ /; Min[p] <= Count[p, Max[p]]], {n, 0, z}] (* A240179 *)
Table[Count[f[n], p_ /; Min[p] == Count[p, Max[p]]], {n, 0, z}] (* A240180 *)
Table[Count[f[n], p_ /; Min[p] > Count[p, Max[p]]], {n, 0, z}] (* A240178, n>0 *)
Table[Count[f[n], p_ /; Min[p] >= Count[p, Max[p]]], {n, 0, z}] (* A240179, n>0 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 02 2014
STATUS
approved