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!)
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; text; 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.
LINKS
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 A131567
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Jan 20 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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)