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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022900 Number of solutions to c(1)p(3)+...+c(n)p(n+2) = 0, where c(i) = +-1 for i>1, c(1) = 1, p(i) = primes. 0
0, 0, 0, 1, 0, 1, 0, 1, 0, 8, 0, 22, 0, 42, 0, 147, 0, 663, 0, 1803, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,10

CROSSREFS

Sequence in context: A112268 A077062 A189764 * A028652 A028636 A028620

Adjacent sequences:  A022897 A022898 A022899 * A022901 A022902 A022903

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 February 17 00:09 EST 2012. Contains 205978 sequences.