login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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: A019673 A229780 A272031 * A063572 A205294 A372806
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Jan 20 2004
STATUS
approved