proposed
approved
proposed
approved
editing
proposed
Antti Karttunen, <a href="/A072344/b072344.txt">Table of n, a(n) for n = 1..10000</a>
a(n) = A034693(A000010(n)). - Antti Karttunen, Aug 22 2017
(PARI)
A034693(n) = { my(k=1); while(!isprime(1+(k*n)), k++); k; };
A072344(n) = A034693(eulerphi(n)); \\ Antti Karttunen, Aug 22 2017
approved
editing
_Joseph L. Pe (joseph_l_pe(AT)hotmail.com), _, Jul 16 2002
phi(35) = 24, and the least natural number k such that 24 k + 1 is prime is k = 3; so a(35) = 3.
nonn,new
nonn
a(n) = the least natural number k such that k*phi(n) + 1 is prime.
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 3, 1, 1, 1, 3, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 2, 3, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 1, 3, 2, 3, 1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 2, 1, 1, 3, 3, 1, 2, 1, 1, 3, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 2, 2
1,15
phi(35) = 24, and the least natural number k such that 24 k + 1 is prime is k = 3; so a(35) = 3.
f[n_] := Module[{i}, i = 0; While[ ! PrimeQ[i*EulerPhi[n] + 1], i++ ]; i]; Table[f[i], {i, 1, 150}]
nonn
Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jul 16 2002
approved