login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022899 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. 0

%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_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 17 23:56 EDT 2013. Contains 226327 sequences.