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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A210502 a(1) = 1, a(n) = A210501(n) - 1. 3
 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 2, 2, 1, 0, 0, 0, 3, 0, 0, 5, 0, 0, 1, 3, 1, 0, 0, 3, 1, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 4, 0, 3, 0, 0, 0, 0, 0, 0, 1, 0, 9, 0, 0, 0, 0, 0, 3, 2, 0, 0, 0, 0, 5, 0, 0, 4, 0, 2, 2, 0, 0, 0, 0, 0, 0, 5, 3, 1, 0, 5, 0, 10, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 COMMENTS Number of odd solutions to phi(k) = prime(n) - 1, except k = prime(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(1) = 1, a(n) = A058339(n) - A210500(n) - 1. CROSSREFS Cf. A000010, A058339, A210500, A210501. Sequence in context: A293051 A049783 A287320 * A350797 A283988 A276204 Adjacent sequences:  A210499 A210500 A210501 * A210503 A210504 A210505 KEYWORD nonn AUTHOR Arkadiusz Wesolowski, Jan 20 2013 STATUS approved

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

Last modified January 26 13:09 EST 2022. Contains 350598 sequences. (Running on oeis4.)