A046078 -id:A046078 - cp's OEIS frontend

A046062 Primes of the form n*phi(n)+1 where phi(n) is the Euler function.

2, 3, 7, 13, 43, 41, 157, 109, 193, 313, 487, 337, 241, 661, 433, 937, 641, 881, 1013, 769, 1249, 2053, 1861, 2269, 3121, 1321, 4423, 3037, 3001, 4621, 1873, 6163, 2017, 5441, 3613, 2161, 6553, 4049, 5581

Offset: 1

Felice Russo

Listed in order of increasing n.

			7 because 3*phi(3)+1 = 7 is prime.

T. D. Noe, Table of n, a(n) for n=1..1000

Cf. A002618, A046078.

Select[Array[# EulerPhi[#]+1&,500],PrimeQ] (* Harvey P. Dale, Apr 21 2012 *)

A059109 Numbers m such that m*phi(m)-1 is prime, where phi is the Euler function (A000010).

Original entry on oeis.org

3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 16, 17, 18, 21, 24, 25, 26, 29, 30, 31, 33, 35, 36, 38, 42, 47, 54, 61, 63, 65, 66, 67, 71, 74, 75, 78, 81, 87, 91, 97, 99, 101, 105, 117, 119, 121, 123, 127, 128, 131, 132, 135, 139, 140, 143, 144, 147, 149, 154, 156, 158, 162, 172

Offset: 1

Jud McCranie, Jan 03 2001

nonn

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A000010, A046078.

[n: n in [1..200] | IsPrime(n*EulerPhi(n)-1)]; // Vincenzo Librandi, Jul 31 2018

Select[Range[200],PrimeQ[# EulerPhi[#]-1]&] (* Harvey P. Dale, Aug 23 2012 *)

is(n)=isprime(n*eulerphi(n)-1) \\ Charles R Greathouse IV, Feb 21 2013

cp's OEIS Frontend

A046062 Primes of the form n*phi(n)+1 where phi(n) is the Euler function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica