login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309222 a(0) = 6; thereafter a(n) = a(n-1) + prime(n) if prime(n) > a(n-1), otherwise a(n) = a(n-1) - prime(n). 3
6, 4, 1, 6, 13, 2, 15, 32, 13, 36, 7, 38, 1, 42, 85, 38, 91, 32, 93, 26, 97, 24, 103, 20, 109, 12, 113, 10, 117, 8, 121, 248, 117, 254, 115, 264, 113, 270, 107, 274, 101, 280, 99, 290, 97, 294, 95, 306, 83, 310, 81, 314, 75, 316, 65, 322, 59, 328, 57, 334, 53, 336, 43, 350, 39, 352 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Hugo van der Sanden asks if this ever reaches 0. He finds that a(n) > 0 for n < 5*10^10. Probabilistic arguments suggest it will never reach 0.

REFERENCES

Hugo van der Sanden, Posting to Sequence Fans Mailing List, Aug 28 2019

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 0..20000

CROSSREFS

If we start with 0 or 1 instead of 6 we get A008348, A022837.

Similar in spirit to A008344, and has a similar graph.

Sequence in context: A299998 A190405 A180659 * A324034 A086241 A204023

Adjacent sequences:  A309219 A309220 A309221 * A309223 A309224 A309225

KEYWORD

nonn,look

AUTHOR

N. J. A. Sloane, Aug 29 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 21:47 EST 2020. Contains 331066 sequences. (Running on oeis4.)