

A239312


Number of condensed partitions of n; see Comments.


2



1, 1, 1, 2, 3, 3, 5, 6, 9, 10, 14, 16, 23, 27, 33, 41, 51, 62, 75, 93, 111, 134, 159, 189, 226, 271, 317, 376, 445, 520, 609, 714, 832, 972, 1129, 1304, 1520, 1753, 2023, 2326, 2692, 3077, 3540, 4050, 4642, 5298, 6054, 6887, 7854, 8926, 10133, 11501, 13044
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


COMMENTS

Suppose that p is a partition of n. Let x(1), x(2), ..., x(k) be the distinct parts of p, and let m(i) be the multiplicity of x(i) in p. Let c(p) be the partition {m(1)*x(1), m(2)*x(2), ... , x(k)*m(k)} of n. Call a partition q of n a condensed partition of n if q = c(p) for some partition p of n. Then a(n) is the number of distinct condensed partitions of n. Note that c(p) = p if and only if p has distinct parts and that a condensed partitions can have repeated parts.


LINKS

Manfred Scheucher, Table of n, a(n) for n = 0..83
Manfred Scheucher, Python Script


EXAMPLE

a(5) = 3 counts the number of partitions of 5 that result from condensations as shown here: 5 > 5, 41 > 41, 32 > 32, 311 > 32, 221 > 41, 2111 > 32, 11111 > 5.


MATHEMATICA

u[n_, k_] := u[n, k] = Map[Total, Split[IntegerPartitions[n][[k]]]]; t[n_] := t[n] = DeleteDuplicates[Table[Sort[u[n, k]], {k, 1, PartitionsP[n]}]]; Table[Length[t[n]], {n, 0, 30}]


CROSSREFS

Cf. A237685.
Sequence in context: A039860 A084338 A039876 * A070830 A039862 A018051
Adjacent sequences: A239309 A239310 A239311 * A239313 A239314 A239315


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Mar 15 2014


EXTENSIONS

Typo in definition corrected by Manfred Scheucher, May 29 2015


STATUS

approved



