login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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: A068825 A019730 A198838 * A189964 A181910 A367453
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)