|
Search: id:A081243
|
|
|
| A081243 |
|
a(n) = Mod[n+(Mod[Prime[n],3]-1),10] |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
MATHEMATICA
|
digits=200 a=Table[Mod[n+(Mod[Prime[n], 3]-1), 10], {n, 1, digits}]
|
|
CROSSREFS
|
Adjacent sequences: A081240 A081241 A081242 this_sequence A081244 A081245 A081246
Sequence in context: A019963 A108755 A093049 this_sequence A127480 A141446 A077965
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 17 2004
|
|
|
Search completed in 0.002 seconds
|
