|
%I #17 Jul 04 2017 17:33:28
%S 0,0,8,0,7,28,30,0,26,24,112,64,80,116,143,0,155,28,116,176,197,444,
%T 255,64,57,316,80,128,60,424,374,0,602,616,18,784,76,460,944,576,207,
%U 1324,303,1600,782,1016,1929,1792,2382,124,1844,2512,1009,568,1693,704
%N a(n) = 2^n mod n^2.
%H Alois P. Heinz, <a href="/A066606/b066606.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)
%e a(7) = 30 as 2^7 = 128 = (7^2)*2 + 30.
%p a:= n-> 2&^n mod (n^2):
%p seq(a(n), n=1..100); # _Alois P. Heinz_, Jul 04 2017
%t Table[ Mod[ 2^n, n^2], {n, 1, 60} ]
%t Table[PowerMod[2,n,n^2],{n,60}] (* _Harvey P. Dale_, Dec 08 2015 *)
%o (PARI) { for (n=1, 1000, write("b066606.txt", n, " ", 2^n % n^2) ) } \\ _Harry J. Smith_, Mar 10 2010
%K easy,nonn
%O 1,3
%A _Amarnath Murthy_, Dec 22 2001
%E More terms from _Floor van Lamoen_ and _Robert G. Wilson v_, Dec 23 2001
|
