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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104192 a(n) = prime(n) - phi(n). 0

%I #8 Jan 03 2017 02:33:53

%S 1,2,3,5,7,11,11,15,17,25,21,33,29,37,39,45,43,55,49,63,61,69,61,81,

%T 77,89,85,95,81,105,97,115,117,123,125,139,121,145,143,157,139,169,

%U 149,173,173,177,165,207,185,209,201,215,189,233,217,239,233,243,219,265,223

%N a(n) = prime(n) - phi(n).

%t a== Table[Prime[n] - EulerPhi[n], {n, 1, 200}]

%o (PARI) a(n) = prime(n) - eulerphi(n);

%Y Cf. A000010, A000040.

%K nonn

%O 1,2

%A _Roger L. Bagula_, Mar 12 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)