|
%I #15 Oct 19 2017 11:06:12
%S 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,
%T 10,10,10,0,10,32,5,28,10,24,25,0,10,22,10,12,10,8,10,16,31,0,31,16,
%U 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
%N a(n) = 10^n modulo n.
%H Seiichi Manyama, <a href="/A056969/b056969.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = 10*A056968(n) mod n = A011557(n) mod n.
%e a(7) = 3 since 10000000 = 7*1428571+3
%p seq(irem(10^n,n),n=1..78); # _Zerinvary Lajos_, Apr 20 2008
%t Table[PowerMod[10, n, n], {n, 80} ]
%o (PARI) a(n) = lift(Mod(10, n)^n); \\ _Michel Marcus_, Oct 19 2017
%Y 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).
%K nonn
%O 1,6
%A _Henry Bottomley_, Jul 20 2000
|
