Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022896
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022896 Number of solutions to c(1)p(1)+...+c(n)p(n) = 2, where c(i) = +-1 for i>1, c(1) = 1, p(i) = primes. +0
1
1, 0, 0, 0, 0, 0, 2, 0, 4, 0, 14, 0, 40, 0, 125, 0, 394, 0, 1294, 0, 4356 (list; graph; listen)
OFFSET

1,7

CROSSREFS

Sequence in context: A137449 A056946 A111757 this_sequence A100225 A007420 A019219

Adjacent sequences: A022893 A022894 A022895 this_sequence A022897 A022898 A022899

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 December 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research