The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A210500 Number of even solutions to phi(k) = prime(n) - 1. 4
1, 2, 3, 2, 1, 4, 5, 2, 1, 1, 1, 5, 6, 2, 1, 1, 1, 5, 1, 1, 11, 1, 1, 4, 13, 2, 1, 1, 5, 4, 1, 1, 1, 1, 1, 1, 4, 2, 1, 1, 1, 5, 1, 17, 1, 1, 1, 1, 1, 1, 4, 1, 21, 1, 9, 1, 1, 1, 5, 5, 1, 1, 1, 1, 10, 1, 1, 13, 1, 3, 9, 1, 1, 1, 1, 1, 1, 7, 9, 4, 1, 7, 1, 23, 1, 1, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) >= A210501(n).
REFERENCES
Alexander S. Karpenko, Lukasiewicz's Logics and Prime Numbers, Luniver Press, Beckington, 2006, pp. 52-56.
LINKS
Arkadiusz Wesolowski, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = A058339(n) - A210501(n).
EXAMPLE
The set {k: phi(k) = 12} is {13, 21, 26, 28, 36, 42}. Thus, if phi(k) = prime(6) - 1, the equation has exactly four even solutions. Hence, a(6) = 4.
MATHEMATICA
r = 87; lst1 = Table[EulerPhi[n], {n, (Prime[r] - 1)^2 + 2}]; lst2 = {}; Do[p = Prime[n]; AppendTo[lst2, Length@Select[Flatten@Position[Take[lst1, {p - 1, (p - 1)^2 + 2}], Prime[n] - 1], OddQ]], {n, r}]; lst2
CROSSREFS
Sequence in context: A105789 A259579 A076549 * A336126 A336153 A299765
KEYWORD
nonn
AUTHOR
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 June 5 16:08 EDT 2024. Contains 373107 sequences. (Running on oeis4.)