|
|
A238946
|
|
Maximal level size of arcs in divisor lattice D(n).
|
|
3
|
|
|
0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 1, 3, 1, 3, 2, 2, 1, 3, 1, 2, 1, 3, 1, 6, 1, 1, 2, 2, 2, 4, 1, 2, 2, 3, 1, 6, 1, 3, 3, 2, 1, 3, 1, 3, 2, 3, 1, 3, 2, 3, 2, 2, 1, 7, 1, 2, 3, 1, 2, 6, 1, 3, 2, 6, 1, 5, 1, 2, 3, 3, 2, 6, 1, 3, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
A divisor d of n has level given by bigomega(d) and in-degree given by omega(d). The number of arcs on a level is the sum of the in-degrees of all divisors on the level. - Andrew Howroyd, Mar 28 2020
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n)={if(n==1, 0, my(v=vector(bigomega(n))); fordiv(n, d, if(d>1, v[bigomega(d)] += omega(d))); vecmax(v))} \\ Andrew Howroyd, Mar 28 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|