login
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
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
KEYWORD
nonn
AUTHOR
STATUS
approved