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 A114207 #19 Apr 28 2017 13:01:56
%S A114207 3,111,13203,20439,1997001,22494039,116226009,761157,278522253,
%T A114207 206613747,17677747557,835525881,12933400720959,228717562653,
%U A114207 5465090439,13095850041,431138536893,4734551277,58199580096201,59875330325409,228520359,3003003,257494085001,1029221499627,136635497220969
%N A114207 Smallest solution to 10^m == 1 (mod m) having the prime divisor A066364(n).
%H A114207 Ray Chandler, <a href="/A114207/b114207.txt">Table of n, a(n) for n = 1..2060</a> (first 501 terms from Max Alekseyev)
%F A114207 a(n)=m(p), where p=A066364(n) and m(p)=lcm(p, ord_p(10), m(q)) with q going over all prime divisors of ord_p(10).
%e A114207 a(6)=m(5477)=22494039 since it is the smallest m such that 10^m == 1 (mod m) and 5477|m.
%o A114207 (PARI) { m(p) = my(f,l,q); f=factorint(p)[,1]; l=p; for(i=1,length(f),q=znorder(Mod(10,f[i])); l=lcm(l,q); l=lcm(l,m(q)) ); l }
%Y A114207 Cf. A066364.
%K A114207 nonn
%O A114207 1,1
%A A114207 _Max Alekseyev_, Nov 17 2005