A318838 Product_{d|n, A007431(d) > 0} prime(A007431(d)), where A007431 is the Möbius transform of Euler's totient function.

2, 2, 4, 4, 10, 4, 22, 12, 28, 10, 46, 16, 62, 22, 100, 84, 94, 28, 118, 100, 484, 46, 146, 144, 530, 62, 1036, 484, 206, 100, 218, 1596, 2116, 94, 5170, 784, 298, 118, 3844, 3900, 334, 484, 358, 2116, 25900, 146, 394, 7056, 3322, 530, 8836, 3844, 466, 1036, 23690, 42108, 13924, 206, 538, 10000, 554, 218, 240548

Offset

1,1

Links

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

Formula

a(n) = product_{d|n} A008578(1+A007431(d)).

For all n >= 1, A056239(a(n)) = A000010(n).

Prog

(PARI)
A007431(n) = sumdiv(n, d, moebius(n/d)*eulerphi(d));
A318838(n) = { my(m=1); fordiv(n, d, if((A007431(d)!=0), m *= prime(A007431(d)))); (m); };

Crossrefs

Cf. A000010, A007431, A318839 (rgs-transform).

Cf. also A318836.

Sequence in context: A099537 A109525 A243330 * A231523 A114338 A170831

Adjacent sequences: A318835 A318836 A318837 * A318839 A318840 A318841

Keyword

nonn

Author

Antti Karttunen, Sep 05 2018

Status

approved