login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056969 a(n) = 10^n modulo n. 11
0, 0, 1, 0, 0, 4, 3, 0, 1, 0, 10, 4, 10, 2, 10, 0, 10, 10, 10, 0, 13, 12, 10, 16, 0, 22, 1, 4, 10, 10, 10, 0, 10, 32, 5, 28, 10, 24, 25, 0, 10, 22, 10, 12, 10, 8, 10, 16, 31, 0, 31, 16, 10, 28, 10, 16, 31, 42, 10, 40, 10, 38, 55, 0, 30, 34, 10, 4, 34, 60, 10, 64, 10, 26, 25, 44, 54, 40 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = 10*A056968(n) mod n = A011557(n) mod n.

EXAMPLE

a(7) = 3 since 10000000 = 7*1428571+3

MAPLE

seq(irem(10^n, n), n=1..78); # Zerinvary Lajos, Apr 20 2008

MATHEMATICA

Table[PowerMod[10, n, n], {n, 80} ]

PROG

(PARI) a(n) = lift(Mod(10, n)^n); \\ Michel Marcus, Oct 19 2017

CROSSREFS

Cf. k^n mod n: A015910 (k=2), A066601 (k=3), A066602 (k=4), A066603 (k=5), A066604 (k=6), A066438 (k=7), A066439 (k=8), A066440 (k=9), this sequence (k=10), A066441 (k=11), A066442 (k=12), A116609 (k=13).

Sequence in context: A274818 A274819 A106646 * A131106 A298739 A294188

Adjacent sequences:  A056966 A056967 A056968 * A056970 A056971 A056972

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 16:45 EDT 2019. Contains 322209 sequences. (Running on oeis4.)