|
%I #24 Jan 20 2024 16:06:49
%S 0,1,2,4,3,7,12,4,10,12,20,32,5,13,17,28,33,52,80,6,16,22,36,24,46,72,
%T 54,84,128,192,7,19,27,44,31,59,92,64,75,116,176,135,204,304,448,8,22,
%U 32,52,38,72,112,40,82,96,148,224,104,160,186,280,416,216,324,480,704,1024
%N Size of divisor lattice in canonical order.
%H Andrew Howroyd, <a href="/A238964/b238964.txt">Table of n, a(n) for n = 0..2713</a> (rows 0..20)
%H S.-H. Cha, E. G. DuCasse, and L. V. Quintas, <a href="http://arxiv.org/abs/1405.5283">Graph Invariants Based on the Divides Relation and Ordered by Prime Signatures</a>, arxiv:1405.5283 [math.NT], 2014.
%F T(n,k) = A062799(A063008(n,k)). - _Andrew Howroyd_, Mar 24 2020
%e Triangle T(n,k) begins:
%e 0;
%e 1;
%e 2, 4;
%e 3, 7, 12;
%e 4, 10, 12, 20, 32;
%e 5, 13, 17, 28, 33, 52, 80;
%e 6, 16, 22, 36, 24, 46, 72, 54, 84, 128, 192;
%e ...
%p with(numtheory):
%p b:= (n, i)-> `if`(n=0 or i=1, [[1$n]], [map(x->
%p [i, x[]], b(n-i, min(n-i, i)))[], b(n, i-1)[]]):
%p T:= n-> map(x-> (p-> add(nops(factorset(d)), d=divisors
%p (p)))(mul(ithprime(i)^x[i], i=1..nops(x))), b(n$2))[]:
%p seq(T(n), n=0..9); # _Alois P. Heinz_, Mar 24 2020
%o (PARI) \\ here b(n) is A062799.
%o b(n)={sumdiv(n, d, omega(d))}
%o N(sig)={prod(k=1, #sig, prime(k)^sig[k])}
%o Row(n)={apply(s->b(N(s)), vecsort([Vecrev(p) | p<-partitions(n)], , 4))}
%o {concat(vector(9, n, Row(n-1)))} \\ _Andrew Howroyd_, Mar 24 2020
%Y Cf. A238953 in canonical order.
%Y Cf. A062799, A063008.
%K nonn,tabf
%O 0,3
%A _Sung-Hyuk Cha_, Mar 07 2014
%E Offset changed and terms a(50) and beyond from _Andrew Howroyd_, Mar 24 2020
|
