Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022902
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A022902
%S A022902 0,1,0,0,0,2,0,1,0,9,0,24,0,55,0,139,0,593,0,1816,0
%N A022902 Number of solutions to c(1)p(3)+...+c(n)p(n+2) = 2, where c(i) = +-1 
               for i>1, c(1) = 1, p(i) = primes.
%Y A022902 Sequence in context: A059419 A049218 A154469 this_sequence A037273 A158924 
               A025426
%Y A022902 Adjacent sequences: A022899 A022900 A022901 this_sequence A022903 A022904 
               A022905
%K A022902 nonn
%O A022902 1,6
%A A022902 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research