cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A072344 a(n) = the least natural number k such that k*phi(n) + 1 is prime.

Original entry on oeis.org

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
Offset: 1

Views

Author

Joseph L. Pe, Jul 16 2002

Keywords

Examples

			phi(35) = 24 and the least natural number k such that 24 k + 1 is prime is k = 3; so a(35) = 3.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Module[{i}, i = 0; While[ ! PrimeQ[i*EulerPhi[n] + 1], i++ ]; i]; Table[f[i], {i, 1, 150}]
  • PARI
    A034693(n) = { my(k=1); while(!isprime(1+(k*n)), k++); k; };
    A072344(n) = A034693(eulerphi(n)); \\ Antti Karttunen, Aug 22 2017

Formula

a(n) = A034693(A000010(n)). - Antti Karttunen, Aug 22 2017