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!)
A062830 a(n) = n - phi(n) + 1. 6
1, 2, 2, 3, 2, 5, 2, 5, 4, 7, 2, 9, 2, 9, 8, 9, 2, 13, 2, 13, 10, 13, 2, 17, 6, 15, 10, 17, 2, 23, 2, 17, 14, 19, 12, 25, 2, 21, 16, 25, 2, 31, 2, 25, 22, 25, 2, 33, 8, 31, 20, 29, 2, 37, 16, 33, 22, 31, 2, 45, 2, 33, 28, 33, 18, 47, 2, 37, 26, 47, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This is the cototient(A051953) + 1. If n = p*q for different primes p and q, a(n) = p + q. - Wesley Ivan Hurt, Aug 27 2013
If n is the product of twin primes, (a(n) +- 2)/2 gives the two primes. - Wesley Ivan Hurt, Sep 06 2013
LINKS
FORMULA
a(n) = A051953(n) + 1 = n - A000010(n) + 1. a(A006881(n)) = A008472(A006881(n)). - Wesley Ivan Hurt, Aug 27 2013
a(n) = 2*A067392(n)/n for n > 1. - Robert G. Wilson v, Jul 16 2019
EXAMPLE
a(10) = 7, since 10 - phi(10) + 1 = 10 - 4 + 1 = 7. Also, since 10 is a squarefree semiprime, 7 represents the sum of the distinct prime factors of 10.
MAPLE
with(numtheory); seq(k - phi(k) + 1, k = 1..70); # Wesley Ivan Hurt, Aug 27 2013
MATHEMATICA
Table[n - EulerPhi[n] + 1, {n, 100}] (* Wesley Ivan Hurt, Aug 27 2013 *)
PROG
(PARI) j=[]; for(n=1, 200, j=concat(j, eulerphi(n)-n-1)); j
CROSSREFS
Sequence in context: A298423 A319810 A325250 * A322366 A363724 A345268
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Jul 20 2001
STATUS
approved

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 24 13:58 EDT 2024. Contains 371960 sequences. (Running on oeis4.)