login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022831 a(n) = c(1)p(1)+...+c(n)p(n), where c(i) = 1 if a(i-1) >= p(i) and c(i) = -1 if a(i-1) < p(i), for i = 1,...,n (p(i) = primes). 1
2, 5, 10, 3, 14, 1, 18, 37, 14, 43, 12, 49, 8, 51, 4, 57, 116, 55, 122, 51, 124, 45, 128, 39, 136, 35, 138, 31, 140, 27, 154, 23, 160, 21, 170, 19, 176, 13, 180, 7, 186, 5, 196, 3, 200, 1, 212, 435, 208, 437, 204, 443, 202, 453, 196, 459, 190, 461, 184 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

Index entries for sequences related to Recaman's sequence

CROSSREFS

Sequence in context: A125974 A059955 A099796 * A064365 A177356 A078322

Adjacent sequences:  A022828 A022829 A022830 * A022832 A022833 A022834

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 15:48 EST 2012. Contains 205930 sequences.