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!)
A056968 10^(n-1) modulo n. 1
0, 0, 1, 0, 0, 4, 1, 0, 1, 0, 1, 4, 1, 10, 10, 0, 1, 10, 1, 0, 16, 10, 1, 16, 0, 10, 19, 20, 1, 10, 1, 0, 1, 10, 25, 28, 1, 10, 22, 0, 1, 40, 1, 32, 10, 10, 1, 16, 8, 0, 49, 12, 1, 46, 45, 24, 43, 10, 1, 40, 1, 10, 37, 0, 55, 10, 1, 48, 31, 20, 1, 64, 1, 10, 25, 12, 67, 4, 1, 0, 73, 10, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
If n is of form 2^i*5^j then a(n)=0, otherwise a(n)=10^(n-1)+n-A053041(n)
EXAMPLE
a(6)=4 since 100000=6*16666+4
MATHEMATICA
Table[PowerMod[10, n-1, n], {n, 100}] (* Harvey P. Dale, Jul 17 2021 *)
CROSSREFS
Sequence in context: A161739 A291574 A094924 * A340221 A213541 A181435
KEYWORD
nonn
AUTHOR
Henry Bottomley, Jul 20 2000
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 29 17:47 EDT 2024. Contains 372114 sequences. (Running on oeis4.)