login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Primes of the form phi(n)-1 sorted by increasing n, where phi is the Euler totient function.
2

%I #18 Jul 17 2012 02:34:08

%S 3,5,3,5,3,3,11,5,7,7,5,17,7,11,7,19,11,17,11,7,29,19,23,11,17,23,11,

%T 41,19,23,41,19,31,23,17,23,59,29,31,47,19,31,43,23,23,71,59,23,31,53,

%U 23,41,23,71,43,59,71,31,41,59,31,101,47,47,107,71,47,71,31,109,59,79,59,83

%N Primes of the form phi(n)-1 sorted by increasing n, where phi is the Euler totient function.

%C Primes in A109606.

%H Vincenzo Librandi, <a href="/A214287/b214287.txt">Table of n, a(n) for n = 1..1000</a>

%t Select[Table[EulerPhi[n]-1,{n,1,1000}],PrimeQ]

%Y Cf. A000010, A078892 (associated n), A214288.

%K nonn,easy

%O 1,1

%A _Vincenzo Librandi_, Jul 13 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 22:57 EDT 2024. Contains 376090 sequences. (Running on oeis4.)