login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #11 Jan 21 2013 15:03:32

%S 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,

%T 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,

%U 0,2,2,0,0,0,0,0,0,5,3,1,0,5,0,10,0,0,2

%N a(1) = 1, a(n) = A210501(n) - 1.

%C Number of odd solutions to phi(k) = prime(n) - 1, except k = prime(n).

%D Alexander S. Karpenko, Lukasiewicz's Logics and Prime Numbers, Luniver Press, Beckington, 2006, pp. 52-56.

%H Arkadiusz Wesolowski, <a href="/A210502/b210502.txt">Table of n, a(n) for n = 1..1000</a>

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

%Y Cf. A000010, A058339, A210500, A210501.

%K nonn

%O 1,12

%A _Arkadiusz Wesolowski_, Jan 20 2013