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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022920 Number of solutions to c(1)p(4)+...+c(n)p(n+3) = 2, where c(i) = +-1 for i>1, c(1) = 1, p(i) = primes. 0
0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 17, 0, 53, 0, 132, 0, 486, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,10

CROSSREFS

Sequence in context: A024418 A167297 A027635 * A093782 A085105 A094031

Adjacent sequences:  A022917 A022918 A022919 * A022921 A022922 A022923

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 13 20:26 EST 2012. Contains 205553 sequences.