A242649 Dirichlet g.f.: Product_{n>=2} 1/(1-1/n^s)^d(n), where d(n) = A000005(n) is the number of divisors of n.

1, 2, 2, 6, 2, 8, 2, 14, 6, 8, 2, 26, 2, 8, 8, 33, 2, 26, 2, 26, 8, 8, 2, 72, 6, 8, 14, 26, 2, 40, 2, 70, 8, 8, 8, 95, 2, 8, 8, 72, 2, 40, 2, 26, 26, 8, 2, 184, 6, 26, 8, 26, 2, 72, 8, 72, 8, 8, 2, 148, 2, 8, 26, 149, 8, 40, 2, 26, 8, 40, 2, 282, 2, 8, 26

Offset

1,2

Links

Antti Karttunen, Table of n, a(n) for n = 1..10001

Prog

(PARI) \\ Based on Michael Somos's code for A007896
n=101;
v = vector(n, k, k==1);
for(k=2, n, m = #digits(n, k) - 1; A = (1 - x)^ -(sigma(k, 0)) + x * O(x^m); w = vector(n); for(i=0, m, w[k^i] = polcoeff(A, i)); v = dirmul(v, w));
v

Crossrefs

Cf. A000005, A007896, A050367, A242649.

Sequence in context: A327991 A193322 A165460 * A294876 A293514 A028330

Adjacent sequences: A242646 A242647 A242648 * A242650 A242651 A242652

Keyword

nonn

Author

N. J. A. Sloane, May 26 2014

Status

approved