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!)
A081243 a(n) = Mod[n+(Mod[Prime[n],3]-1),10] 0
2, 1, 4, 4, 6, 6, 8, 8, 0, 1, 1, 2, 4, 4, 6, 7, 8, 8, 9, 1, 1, 2, 4, 5, 5, 7, 7, 9, 9, 1, 1, 3, 4, 4, 6, 6, 7, 8, 0, 1, 2, 2, 4, 4, 6, 6, 7, 8, 0, 0, 2, 3, 3, 5, 6, 7, 8, 8, 9, 1, 1, 3, 3, 5, 5, 7, 7, 8, 0, 0, 2, 3, 3, 4, 5, 7, 8, 8, 0, 0, 2, 2, 4, 4, 5, 7, 8, 8, 0, 0, 2, 3, 3, 5, 5, 7, 8, 9, 9, 0, 1, 3, 4, 5, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Modulo 10 integer cycle on symbols {1,2,3,4,5,6,7,8,9,0} coded with the primes modulo 3.
The function : f[n_]=Mod[Prime[n],3]-1 is binary except for n=2.
LINKS
MATHEMATICA
digits=200 a=Table[Mod[n+(Mod[Prime[n], 3]-1), 10], {n, 1, digits}]
CROSSREFS
Sequence in context: A108755 A093049 A326146 * A261297 A308034 A289918
KEYWORD
nonn
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 July 14 00:54 EDT 2024. Contains 374290 sequences. (Running on oeis4.)