A081243 a(n) = Mod[n+(Mod[Prime[n],3]-1),10]

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

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

Table of n, a(n) for n=1..105.

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

Adjacent sequences: A081240 A081241 A081242 * A081244 A081245 A081246

Keyword

nonn

Author

Roger L. Bagula, Jan 17 2004

Status

approved