

A273044


Discriminator of A003095.


2



1, 2, 5, 9, 10, 10, 17, 29, 29, 29, 47, 47, 47, 61, 71, 71, 71, 101, 109, 121, 121, 121, 121, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 274, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The discriminator of a sequence is the least integer k such that the first n terms are pairwise incongruent, modulo k.


LINKS



MAPLE

N:= 1000: # to get a(1)..a(n)
nmax:= 0:
for m from 1 while nmax <= N do
a:= 1 mod m; A:= {a};
for n from 1 while nops(A) = n do
a:= a^2 +1 mod m;
A:= A union {a};
od:
for k from nmax+1 to n1 do v[k]:= m od:
nmax:= max(nmax, n1);
od:


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



