login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089101 a(n) = (n - 4 + prime(n) mod 9) mod 10. 0
9, 1, 4, 7, 3, 6, 1, 5, 0, 8, 1, 9, 4, 7, 3, 0, 8, 1, 9, 4, 8, 5, 1, 8, 8, 4, 7, 2, 6, 1, 8, 3, 1, 4, 6, 9, 7, 5, 0, 8, 5, 9, 1, 4, 9, 3, 7, 1, 7, 0, 5, 3, 6, 8, 6, 4, 1, 5, 2, 8, 1, 3, 0, 5, 8, 4, 0, 8, 0, 3, 9, 6, 6, 4, 2, 7, 5, 5, 0, 0, 2, 5, 7, 1, 8, 4, 1, 1, 7, 0, 5, 0, 0, 5, 5, 0, 8, 2, 6, 7, 4, 6, 4, 2, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Integer cycle modulo ten of symbols {0,1,2,3,4,5,6,7,8,9,0} modulated with the primes modulo 9.

Concerned with the maximum amount of information that can be hidden as a typo in a modulo-10 cycle and the information regenerated.

LINKS

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

MATHEMATICA

digits=200 a=Table[Mod[n+(Mod[Prime[n], 9]-4), 10], {n, 1, digits}]

CROSSREFS

Sequence in context: A089564 A178745 A114893 * A298512 A192930 A010168

Adjacent sequences:  A089098 A089099 A089100 * A089102 A089103 A089104

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Jan 17 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 25 23:17 EDT 2020. Contains 338026 sequences. (Running on oeis4.)