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.

A125000 Integers n such that 2^n == 19 (mod n).

Original entry on oeis.org

1, 17, 2873, 10081, 3345113, 420048673, 449349533, 2961432773, 19723772249, 821451792317, 1207046362769
Offset: 1

Views

Author

Zak Seidov, Nov 15 2006

Keywords

Comments

No other terms below 10^15. Some larger terms: 500796684074966733196301. - Max Alekseyev, May 23 2012

Crossrefs

Programs

  • Mathematica
    m = 19; Join[Select[Range[m], Divisible[2^# - m, #] &],
    Select[Range[m + 1, 10^6], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 08 2018 *)

Extensions

Terms 1, 17 prepended by Max Alekseyev, May 20 2011
a(8)-a(11) from Max Alekseyev, May 23 2012