login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034900 a(n) is square mod a(i), i < n; a(n) prime; a(1) = 2. 2

%I #11 Sep 24 2020 11:37:33

%S 2,3,7,37,67,127,211,1999,3823,5623,5779,12163,17683,41227,180667,

%T 186727,1901209,5176711,5830819,10593997,36065149,66423067,89635303,

%U 117961621,121703311,225511939,410967463

%N a(n) is square mod a(i), i < n; a(n) prime; a(1) = 2.

%o (PARI) isok(newp, v, n) = {for (k=1, n, if (!issquare(Mod(newp, v[k])), return (0));); return (1);}

%o lista(nn) = {my(v=vector(nn), lastp=2); v[1] = lastp; for (n=2, nn, my(newp = nextprime(lastp+1)); while (! isok(newp, v, n-1), newp = nextprime(newp+1)); v[n] = newp; lastp = newp;); v;} \\ _Michel Marcus_, Sep 24 2020

%Y Cf. A034901, A034902.

%K nonn,more

%O 1,1

%A _David W. Wilson_

%E Name edited by _Michel Marcus_, Sep 24 2020

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)