|
0, 1, 2, 2, 3, 4, 4, 3, 4, 6, 5, 6, 6, 8, 6, 4, 7, 6, 8, 9, 8, 10, 9, 8, 6, 12, 6, 12, 10, 9, 11, 5, 10, 14, 8, 8, 12, 16, 12, 12, 13, 12, 14, 15, 9, 18, 15, 10, 8, 9, 14, 18, 16, 8, 10, 16, 16, 20, 17, 12, 18, 22, 12, 6, 12, 15, 19, 21, 18, 12, 20, 10, 21, 24, 9, 24, 10, 18, 22, 15, 8, 26, 23, 16, 14, 28, 20, 20, 24
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so a(n) is the size of the minimal rectangle containing the Young digram of the integer partition with Heinz number n.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[PrimeOmega[n]*PrimePi[FactorInteger[n][[-1, 1]]], {n, 100}]
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|