|
%I #21 Jun 15 2018 21:27:59
%S 0,1,2,1,1,1,4,1,8,1,0,1,11,9,11,1,11,1,11,1,8,11,11,1,1,17,26,25,11,
%T 1,11,1,11,19,16,1,11,7,5,1,11,1,11,33,26,29,11,1,18,1,5,29,11,1,11,9,
%U 20,5,11,1,11,59,8,1,46,55,11,21,20,11,11,1,11,47,26,49,44,25,11,1
%N a(n) = 11^n mod n.
%H Harry J. Smith and Seiichi Manyama, <a href="/A066441/b066441.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)
%p seq(irem(11^n,n),n=1..80); # _Zerinvary Lajos_, Apr 20 2008
%t Table[PowerMod[11, n, n], {n, 80} ]
%o (PARI) { for (n=1, 1000, write("b066441.txt", n, " ", 11^n % n) ) } \\ _Harry J. Smith_, Feb 14 2010
%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), A056969 (k=10), this sequence (k=11), A066442 (k=12), A116609 (k=13).
%K nonn
%O 1,3
%A _Robert G. Wilson v_, Dec 27 2001
|
