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

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!)
 A089103 a(n) = Mod[n+Prime[n],10] 0
 3, 5, 8, 1, 6, 9, 4, 7, 2, 9, 2, 9, 4, 7, 2, 9, 6, 9, 6, 1, 4, 1, 6, 3, 2, 7, 0, 5, 8, 3, 8, 3, 0, 3, 4, 7, 4, 1, 6, 3, 0, 3, 4, 7, 2, 5, 8, 1, 6, 9, 4, 1, 4, 5, 2, 9, 6, 9, 6, 1, 4, 5, 0, 5, 8, 3, 8, 5, 6, 9, 4, 1, 0, 7, 4, 9, 6, 5, 0, 9, 0, 3, 4, 7, 4, 9, 6, 5, 0, 3, 8, 1, 0, 5, 4, 9, 6, 9, 2, 1, 8, 9, 6, 3, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA digits=200 a=Table[Mod[n+Prime[n], 10], {n, 1, digits}] PROG (PARI) first(n)=(primes(n)+[1..n])%10 \\ Charles R Greathouse IV, Dec 06 2016 CROSSREFS Sequence in context: A097911 A019730 A198838 * A189964 A181910 A222494 Adjacent sequences:  A089100 A089101 A089102 * A089104 A089105 A089106 KEYWORD nonn,easy AUTHOR Roger L. Bagula, Jan 17 2004 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.

Last modified January 18 14:07 EST 2021. Contains 340254 sequences. (Running on oeis4.)