This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A066603 #22 Dec 07 2024 11:32:09
%S A066603 0,1,2,1,0,1,5,1,8,5,5,1,5,11,5,1,5,1,5,5,20,3,5,1,0,25,26,9,5,25,5,1,
%T A066603 26,25,10,1,5,25,8,25,5,1,5,9,35,25,5,1,19,25,23,1,5,1,45,25,11,25,5,
%U A066603 25,5,25,62,1,5,49,5,13,56,65,5,1,5,25,50,17,3,25,5,65,80,25,5,1,65
%N A066603 a(n) = 5^n mod n.
%H A066603 Harry J. Smith and Seiichi Manyama, <a href="/A066603/b066603.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)
%e A066603 a(7) = 5 as 5^7 = 78125 = 7*11160 + 5.
%p A066603 seq(irem(5^n,n),n=1..85); # _Zerinvary Lajos_, Apr 20 2008
%t A066603 Table[PowerMod[5, n, n], {n, 85} ]
%o A066603 (PARI) a(n) = { lift(Mod(5, n)^n) } \\ _Harry J. Smith_, Mar 09 2010
%Y A066603 Cf. k^n mod n: A015910 (k=2), A066601 (k=3), A066602 (k=4), this sequence (k=5), A066604 (k=6), A066438 (k=7), A066439 (k=8), A066440 (k=9), A056969 (k=10), A066441 (k=11), A066442 (k=12), A116609 (k=13).
%K A066603 easy,nonn
%O A066603 1,3
%A A066603 _Amarnath Murthy_, Dec 22 2001
%E A066603 More terms from _Robert G. Wilson v_, Dec 27 2001