Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022920
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022920 Number of solutions to c(1)p(4)+...+c(n)p(n+3) = 2, where c(i) = +-1 for i>1, c(1) = 1, p(i) = primes. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 17, 0, 53, 0, 132, 0, 486, 0 (list; graph; listen)
OFFSET

1,10

CROSSREFS

Sequence in context: A024418 A167297 A027635 this_sequence A093782 A085105 A094031

Adjacent sequences: A022917 A022918 A022919 this_sequence A022921 A022922 A022923

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research