login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Robert Israel, Table of n, a(n) for n = 1..10000

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 n-1 do v[k]:= m od:

  nmax:= max(nmax, n-1);

od:

seq(v[k], k=1..N); # Robert Israel, May 13 2016

CROSSREFS

Cf. A003095

Sequence in context: A002580 A196408 A091656 * A133508 A125969 A070240

Adjacent sequences:  A273041 A273042 A273043 * A273045 A273046 A273047

KEYWORD

nonn

AUTHOR

Jeffrey Shallit, May 13 2016

EXTENSIONS

a(31)-a(56) from Robert Israel, May 13 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 2 15:03 EDT 2021. Contains 346428 sequences. (Running on oeis4.)