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 A273043 #16 May 14 2016 13:43:46 %S A273043 1,3,3,7,37,37,37,37,37,37,59,59,59,59,73,73,73,73,73,97,97,97,137, %T A273043 157,157,157,157,157,157,157,157,157,157,157,157,157,157,157,157,157, %U A273043 251,251,251,251,251,251,251,251,251,251,277,277,277,277,277,277,277 %N A273043 Discriminator of sequence A001566. %C A273043 The discriminator of a sequence is the least integer k such that the first n terms of the sequence are pairwise incongruent, modulo k. %H A273043 Robert Israel, <a href="/A273043/b273043.txt">Table of n, a(n) for n = 1..10000</a> %p A273043 N:= 1000: # to get a(1)..a(n) %p A273043 nmax:= 0: %p A273043 for m from 1 while nmax <= N do %p A273043 a:= 3 mod m; A:= {a}; %p A273043 for n from 1 while nops(A) = n do %p A273043 a:= a^2 - 2 mod m; %p A273043 A:= A union {a}; %p A273043 od: %p A273043 for k from nmax+1 to n-1 do v[k]:= m od: %p A273043 nmax:= max(nmax,n-1); %p A273043 od: %p A273043 seq(v[k],k=1..N); # _Robert Israel_, May 13 2016 %Y A273043 Cf. A001566. %K A273043 nonn %O A273043 1,2 %A A273043 _Jeffrey Shallit_, May 13 2016 %E A273043 a(13)-a(28) from _Tom Edgar_, May 13 2016 %E A273043 a(29)-a(57) from _Robert Israel_, May 13 2016