|
|
A234092
|
|
Limit of v(m,n) as m->oo, where v(m,n) is the number of distinct terms in the n-th partition of m in Mathematica (lexicographic) ordering of the partitions of m.
|
|
0
|
|
|
1, 2, 2, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 3, 3, 3, 3, 2, 2, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 4, 3, 2, 4, 3, 4, 3, 3, 3, 4, 4, 3, 2, 3, 3, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 4, 4, 4, 3, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
In Mathematica ordering, the 9th partition of n >= 8 is [n-4,3,1]. Thus, v(n,9) = 3 for n all n >= 8, so a(n) = 3.
|
|
MATHEMATICA
|
Table[Length[Union[IntegerPartitions[40][[k]]]], {k, 1, 150}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|