A210502 a(1) = 1, a(n) = A210501(n) - 1.

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

Author

Arkadiusz Wesolowski, Jan 20 2013

Keywords

• nonn

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

Crossrefs

Cf. A000010, A058339, A210500, A210501.

Formula

a(1) = 1, a(n) = A058339(n) - A210500(n) - 1.