Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022901
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022901 Number of solutions to c(1)p(3)+...+c(n)p(n+2) = 1, where c(i) = +-1 for i>1, c(1) = 1, p(i) = primes. +0
1
0, 0, 0, 0, 0, 0, 1, 0, 6, 0, 9, 0, 36, 0, 82, 0, 382, 0, 1229, 0, 3557 (list; graph; listen)
OFFSET

1,9

CROSSREFS

Sequence in context: A114530 A085673 A117492 this_sequence A022903 A133077 A016628

Adjacent sequences: A022898 A022899 A022900 this_sequence A022902 A022903 A022904

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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research