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.

A081889 Least primitive root corresponding to A081888(n).

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 19, 21, 23, 31, 35, 41, 43, 53, 57, 69, 87, 93, 95, 101, 115, 141, 173, 203
Offset: 1

Views

Author

Sven Simon, Mar 30 2003

Keywords

Crossrefs

Programs

  • Python
    from sympy import primitive_root
    from itertools import count, islice
    def f(n): r = primitive_root(n); return r if r != None else 0
    def agen(r=0): yield from ((m, r:=f(m))[1] for m in count(1) if f(m) > r)
    print(list(islice(agen(), 18))) # Michael S. Branicky, Feb 13 2023

Extensions

a(24) from Michael S. Branicky, Feb 20 2023