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.

A114686 Primes with 71 as smallest positive primitive root.

Original entry on oeis.org

3659401, 8453041, 10319761, 14155681, 16391761, 18094561, 19616689, 20456329, 21677041, 22628929, 27275161, 32051881, 34228489, 37728601, 38884561, 39191881, 40101071, 40167241, 42163969, 47931601, 48461449, 49460161, 50389441, 54932329, 56219281, 57590569
Offset: 1

Views

Author

Robert G. Wilson v, Dec 21 2005

Keywords

Crossrefs

Programs

  • Mathematica
    t={}; Do[ If[ PrimitiveRoot[ Prime@n] == 71, AppendTo[t, n]; Print@ Prime@n], {n, 3280000}]; Prime@t
  • PARI
    is(n)=if(n<72,return(0));for(k=2,70,if(znorder(Mod(k,n))==n-1,return(0)));znorder(Mod(71,n))==n-1&&isprime(n) \\ Charles R Greathouse IV, Jul 19 2011
    
  • PARI
    is(n)=isprime(n)&&lift(znprimroot(n))==71 \\ relies on implementation details, may not always work
    \\ Charles R Greathouse IV, Jul 19 2011

Extensions

a(23) and beyond from Robert Price, Nov 20 2023