|
%I #13 Oct 09 2013 02:24:37
%S 0,1,2,1,2,5,5,1,5,7,4,5,10,3,2,1,2,17,5,17,5,17,4,17,22,17,14,17,17,
%T 17,9,1,5,19,12,17,34,17,23,17,38,17,5,21,32,7,22,17,5,17,2,17,43,53,
%U 37,17,29,55,21,17,58,17,5,1,62,17,22,53,65,17,13,17
%N Fermat(n) modulo n.
%C In the first 10000 terms, 17 appears 649 times and 257 appears 781 times. - _T. D. Noe_, Oct 01 2013
%H T. D. Noe, <a href="/A137327/b137327.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A000215(n) mod n.
%p with(numtheory):seq(irem(fermat(n),n),n=1..19);
%p # second Maple program:
%p a:= n-> (2&^(2^n) + 1) mod n:
%p seq(a(n), n=1..100); # _Alois P. Heinz_, Sep 30 2013
%t Table[Mod[PowerMod[2, 2^n, n] + 1, n], {n, 100}] (* _T. D. Noe_, Oct 01 2013 *)
%Y Cf. A155836.
%K nonn
%O 1,3
%A _Zerinvary Lajos_, Apr 20 2008
|
