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 A066069 #9 Jun 16 2018 19:55:00
%S A066069 1,2,3,2,5,6,7,4,3,10,11,6,13,14,15,4,17,6,19,10,21,22,23,6,5,26,3,14,
%T A066069 29,30,31,4,33,34,35,6,37,38,39,10,41,42,43,22,15,46,47,6,7,10,51,26,
%U A066069 53,6,55,14,57,58,59,30,61,62,21,4,65,66,67,34,69,70,71,6,73,74,15,38
%N A066069 a(n) is the smallest positive integer m such that n divides (n + m)^m.
%C A066069 Essentially the same as A019530. - _R. J. Mathar_, Sep 30 2008
%H A066069 Harry J. Smith, <a href="/A066069/b066069.txt">Table of n, a(n) for n = 1..1000</a>
%e A066069 a(8) = 4 because (8+1)^1 mod 8 = 1, (8+2)^2 mod 8 = 4, (8+3)^3 mod 8 = 3 and (8+4)^4 mod 8 = 0.
%o A066069 (PARI) { for (n=1, 1000, m=1; while ((n+m)^m % n, m++); write("b066069.txt", n, " ", m) ) } \\ _Harry J. Smith_, Nov 09 2009
%Y A066069 First 23 terms are the same as A019554.
%K A066069 nonn
%O A066069 1,2
%A A066069 Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Dec 02 2001