A356151 Greatest common divisor of n and the smallest positive k such that n divides k*A276086(k), where A276086 is primorial base exp-function.

1, 1, 1, 4, 5, 2, 7, 8, 3, 5, 11, 4, 13, 7, 5, 16, 17, 3, 19, 4, 7, 11, 23, 8, 5, 13, 9, 28, 29, 5, 31, 32, 11, 17, 7, 4, 37, 19, 13, 8, 41, 14, 43, 44, 5, 23, 47, 16, 7, 10, 17, 52, 53, 9, 11, 8, 19, 29, 59, 4, 61, 31, 21, 64, 13, 11, 67, 68, 23, 7, 71, 8, 73, 37, 5, 76, 11, 26, 79, 16, 27, 41, 83, 28, 17, 43, 29, 88

Offset

1,4

Links

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

Index entries for sequences related to primorial base

Formula

a(n) = gcd(n, A355944(n)) = gcd(n, A355945(n)) = gcd(A355944(n), A355945(n)).

a(n) = n / A356152(n) = A355944(n) / A356153(n).

Prog

(PARI)
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A356151(n) = for(k=1, oo, if((k*A276086(k))%n==0, return(gcd(n, k))));

Crossrefs

Cf. A276086, A324580, A355944, A355945, A356152, A356153.

Sequence in context: A130144 A354634 A118472 * A194880 A111624 A019815

Adjacent sequences: A356148 A356149 A356150 * A356152 A356153 A356154

Keyword

nonn

Author

Antti Karttunen, Jul 28 2022

Status

approved