|
|
A238958
|
|
The number of nodes at odd level in divisor lattice in graded colexicographic order.
|
|
3
|
|
|
0, 1, 1, 2, 2, 3, 4, 2, 4, 4, 6, 8, 3, 5, 6, 8, 9, 12, 16, 3, 6, 7, 8, 10, 12, 13, 16, 18, 24, 32, 4, 7, 9, 10, 12, 15, 16, 18, 20, 24, 27, 32, 36, 48, 64, 4, 8, 10, 12, 12, 14, 18, 20, 22, 24, 24, 30, 32, 36, 40, 40, 48, 54, 64, 72, 96, 128
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = floor(A074139(n,k)/2). (End)
|
|
EXAMPLE
|
Triangle T(n,k) begins:
0;
1;
1, 2;
2, 3, 4;
2, 4, 4, 6, 8;
3, 5, 6, 8, 9, 12, 16;
3, 6, 7, 8, 10, 12, 13, 16, 18, 24, 32;
...
|
|
PROG
|
b(n)={numdiv(n)\2}
N(sig)={prod(k=1, #sig, prime(k)^sig[k])}
Row(n)={apply(s->b(N(s)), [Vecrev(p) | p<-partitions(n)])}
|
|
CROSSREFS
|
Cf. A056924 in graded colexicographic order.
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Offset changed and terms a(50) and beyond from Andrew Howroyd, Apr 01 2020
|
|
STATUS
|
approved
|
|
|
|