|
| |
|
|
A090183
|
|
a(n) = Mod[10-Mod[Prime[n+3],10],4]-Mod[n,4]+3
|
|
0
| |
|
|
5, 2, 3, 6, 3, 4, 1, 4, 5, 2, 3, 6, 5, 2, 1, 6, 3, 4, 1, 6, 3, 4, 1, 6, 5, 2, 3, 6, 3, 4, 1, 4, 3, 4, 3, 6, 5, 2, 1, 4, 5, 4, 1, 4, 5, 4, 1, 6, 3, 2, 1, 6, 5, 2, 1, 6, 3, 4, 3, 6, 3, 4, 3, 4, 5, 4, 1, 6, 3, 4, 3, 4, 5, 2, 3, 4, 3, 2, 1, 4, 5, 2, 3, 4, 5, 2, 3, 6, 3, 4, 1, 4, 5, 2, 1, 6, 3, 4, 3, 6, 3, 2, 3, 6, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,1
|
|
|
COMMENTS
| A coding of the primes {1,3,7,9} digits using mode using modulo four as a pretransform.
This coding loses one degree of freedom in the process.
|
|
|
MATHEMATICA
| digits=200 Table[Mod[10-Mod[Prime[n+3], 10], 4]-Mod[n, 4]+3, {n, 1, digits}]
|
|
|
CROSSREFS
| Sequence in context: A097078 A021195 A019673 * A063572 A205294 A131567
Adjacent sequences: A090180 A090181 A090182 * A090184 A090185 A090186
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 20 2004
|
| |
|
|
