Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022836
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022836 a(n) = c(1)p(i-1)+...+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(0)=1, p(i)=primes). +0
1
1, 3, 6, 1, 8, 19, 6, 23, 4, 27, 56, 25, 62, 21, 64, 17, 70, 11, 72, 5, 76, 3, 82, 165, 76, 173, 72, 175, 68, 177, 64, 191, 60, 197, 58, 207, 56, 213, 50, 217, 44, 223, 42, 233, 40, 237, 38, 249, 26, 253, 24, 257, 18, 259, 8, 265, 2, 271, 542, 265, 546, 263, 556 (list; graph; listen)
OFFSET

0,2

COMMENT

Alternate description: a(1) =1, a(n) = a(n-1) - prime(n) if a(n-1)> prime(n) else a(n) = a(n-1) + prime(n). - Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jun 27 2003

CROSSREFS

A008348(n) + 1.

Sequence in context: A083237 A118948 A118012 this_sequence A090911 A108813 A108591

Adjacent sequences: A022833 A022834 A022835 this_sequence A022837 A022838 A022839

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 July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research