|
|
A329110
|
|
Number of integer sequences 1 <= b_1 < b_2 < ... < b_t <= n such that b_i divides b_(i+1) for all 0 < i < t.
|
|
1
|
|
|
1, 3, 5, 9, 11, 17, 19, 27, 31, 37, 39, 55, 57, 63, 69, 85, 87, 103, 105, 121, 127, 133, 135, 175, 179, 185, 193, 209, 211, 237, 239, 271, 277, 283, 289, 341, 343, 349, 355, 395, 397, 423, 425, 441, 457, 463, 465, 561, 565, 581, 587, 603, 605, 645, 651, 691
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ -2*n^r/(r*zeta'(r)), where r=A107311 is the root of the equation zeta(r)=2.
|
|
EXAMPLE
|
For n = 4 the a(4) = 9 sequences are 1; 1, 2; 1, 2, 4; 1, 3; 1, 4; 2; 2, 4; 3; and 4.
|
|
PROG
|
(PARI) s=0; for (n=1, #(z=vector(56)), print1 (s += z[n]=1+sumdiv(n, k, if (k<n, z[k], 0)) ", ")) \\ Rémy Sigrist, Nov 08 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|