Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022900
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
0, 0, 0, 1, 0, 1, 0, 1, 0, 8, 0, 22, 0, 42, 0, 147, 0, 663, 0, 1803, 0 (list; graph; listen)
OFFSET

1,10

CROSSREFS

Sequence in context: A070489 A112268 A077062 this_sequence A028652 A028636 A028620

Adjacent sequences: A022897 A022898 A022899 this_sequence A022901 A022902 A022903

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research