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.

A276671 Positive integers k such that 3^k == 2 (mod k).

Original entry on oeis.org

1, 2929, 9742277641, 23341869101, 15092205901438895, 16311037042239935
Offset: 1

Views

Author

Max Alekseyev, Oct 05 2016

Keywords

Comments

No other terms below 2*10^16. A larger term: 31744873758348589012852097851.

Crossrefs

Programs

  • Mathematica
    Join[{1}, Select[Range[10000], PowerMod[3, #, #] == 2 &]] (* Alonso del Arte, Oct 11 2016 *)
  • PARI
    isok(n) = Mod(3, n)^n == Mod(2, n); \\ Dmitry Ezhov, Sep 28 2016

Extensions

Order of terms corrected by Felix Fröhlich, Oct 06 2016
a(5)-a(6) from Sergey Paramonov, Oct 03 2021