Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022833
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022833 a(n) = c(1)p(2)+...+c(n)p(n+1), where c(i) = 1 if a(i-1) >= p(i+1) and c(i) = -1 if a(i-1) < p(i+1) (p(i) = primes). +0
1
3, 8, 1, 12, 25, 8, 27, 4, 33, 2, 39, 80, 37, 84, 31, 90, 29, 96, 25, 98, 19, 102, 13, 110, 9, 112, 5, 114, 1, 128, 259, 122, 261, 112, 263, 106, 269, 102, 275, 96, 277, 86, 279, 82, 281, 70, 293, 66, 295, 62, 301, 60, 311, 54, 317, 48, 319, 42, 323, 40 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Sequence in context: A094874 A132338 A132702 this_sequence A152230 A118357 A010627

Adjacent sequences: A022830 A022831 A022832 this_sequence A022834 A022835 A022836

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research