cp's OEIS Frontend

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.

A273044 Discriminator of A003095.

This page as a plain text file.
%I A273044 #18 May 14 2016 13:44:01
%S A273044 1,2,5,9,10,10,17,29,29,29,47,47,47,61,71,71,71,101,109,121,121,121,
%T A273044 121,139,139,139,139,139,139,139,139,139,139,274,278,278,278,278,278,
%U A273044 278,278,278,278,278,278,278,278,278,278,278,278,278,278,278,278,278
%N A273044 Discriminator of A003095.
%C A273044 The discriminator of a sequence is the least integer k such that the first n terms are pairwise incongruent, modulo k.
%H A273044 Robert Israel, <a href="/A273044/b273044.txt">Table of n, a(n) for n = 1..10000</a>
%p A273044 N:= 1000: # to get a(1)..a(n)
%p A273044 nmax:= 0:
%p A273044 for m from 1 while nmax <= N do
%p A273044   a:= 1 mod m; A:= {a};
%p A273044   for n from 1 while nops(A) = n do
%p A273044     a:= a^2 +1 mod m;
%p A273044     A:= A union {a};
%p A273044   od:
%p A273044   for k from nmax+1 to n-1 do v[k]:= m od:
%p A273044   nmax:= max(nmax, n-1);
%p A273044 od:
%p A273044 seq(v[k], k=1..N); # _Robert Israel_, May 13 2016
%Y A273044 Cf. A003095
%K A273044 nonn
%O A273044 1,2
%A A273044 _Jeffrey Shallit_, May 13 2016
%E A273044 a(31)-a(56) from _Robert Israel_, May 13 2016