A324291 Product prime(1+((n-1) mod (p-1))), where p ranges over distinct prime divisors of n.

1, 2, 2, 2, 2, 6, 2, 2, 2, 6, 2, 6, 2, 6, 10, 2, 2, 6, 2, 14, 10, 6, 2, 6, 2, 6, 2, 14, 2, 18, 2, 2, 10, 6, 55, 6, 2, 6, 10, 14, 2, 78, 2, 14, 4, 6, 2, 6, 2, 6, 10, 14, 2, 6, 55, 6, 10, 6, 2, 42, 2, 6, 10, 2, 22, 78, 2, 14, 10, 42, 2, 6, 2, 6, 10, 14, 187, 78, 2, 14, 2, 6, 2, 78, 22, 6, 10, 38, 2, 18, 34, 14, 10, 6, 55, 6, 2, 6, 46, 14, 2, 78, 2, 38, 20

Offset

1,2

Comments

a(n) is a power of 2 if and only if n is a term of A087441.

Links

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

Formula

a(n) = Product_{p|n, p prime} A000040(1+((n-1) mod (p-1))).

A001222(a(n)) = A001221(n).

Prog

(PARI) A324291(n) = if(1==n, 1, my(f=factor(n), m=1); for(i=1, #f[, 1], m *= prime(1+((n-1)%(f[i, 1]-1)))); (m));

Crossrefs

Cf. A000040, A087441, A324290, A324292 (rgs-transform).

Sequence in context: A079894 A335966 A292586 * A114005 A103794 A273258

Adjacent sequences: A324288 A324289 A324290 * A324292 A324293 A324294

Keyword

nonn

Author

Antti Karttunen, Feb 23 2019

Status

approved