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.

Previous Showing 31-32 of 32 results.

A114684 Primes with 69 as smallest positive primitive root.

Original entry on oeis.org

110881, 3236689, 3451009, 7318921, 8180041, 15124201, 20552449, 20753329, 22078681, 22772689, 23048089, 25454521, 32367721, 33937201, 35428511, 37842841, 39070249, 42598609, 47627711, 52920169, 63360361, 69656161, 71472361, 73323721, 77630281, 78504721
Offset: 1

Views

Author

Robert G. Wilson v, Dec 21 2005

Keywords

Crossrefs

Programs

  • Mathematica
    (* first load *) << NumberTheory`NumberTheoryFunctions` (* then *) t={}; Do[ If[ PrimitiveRoot[ Prime@n] == 69, AppendTo[t, n]; Print@Prime@n], {n, 4310000}]; Prime@t

Extensions

a(23) and beyond from Robert Price, Nov 20 2023
a(23) inserted by David Radcliffe, Aug 04 2025

A114685 Primes with 70 as smallest positive primitive root.

Original entry on oeis.org

5620201, 137084401, 261429481, 319917841, 463954921, 490203481, 533231641, 549100081, 574690801, 600595381, 633627721, 644868481, 647913601, 704247361, 713084641, 722120881, 874850161, 916971961, 918152161, 1030871161, 1056236833, 1062355369, 1096459321
Offset: 1

Views

Author

Robert G. Wilson v, Dec 21 2005

Keywords

Crossrefs

Programs

  • Mathematica
    (* first load *) << NumberTheory`NumberTheoryFunctions` (* then *) t={}; Do[ If[ PrimitiveRoot[ Prime@n] == 70, AppendTo[t, n]; Print@Prime@n], {n, 53600000}]; Prime@t
    Select[Prime[Range[524*10^5]],PrimitiveRoot[#,1]==70&] (* Harvey P. Dale, Jun 22 2021 *)

Extensions

a(21)-a(23) from Robert Price, Nov 26 2023
Previous Showing 31-32 of 32 results.