Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022899
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
0, 1, 0, 1, 0, 1, 0, 3, 0, 6, 0, 19, 0, 61, 0, 197, 0, 644, 0 (list; graph; listen)
OFFSET

1,8

CROSSREFS

Sequence in context: A115456 A007386 A007385 this_sequence A081978 A117784 A111074

Adjacent sequences: A022896 A022897 A022898 this_sequence A022900 A022901 A022902

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research