%I
%S 0,1,0,1,0,1,0,3,0,6,0,19,0,61,0,197,0,644,0
%N Number of solutions to c(1)p(2)+...+c(n)p(n+1) = 2, where c(i) = +-1 for i>1, c(1) = 1, p(i) = primes.
%K nonn
%O 1,8
%A _Clark Kimberling_