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.

A277630 Positive integers n such that 3^n == 8 (mod n).

Original entry on oeis.org

1, 5, 2352527, 193841707, 17126009179703, 380211619942943
Offset: 1

Views

Author

Dmitry Ezhov, Oct 24 2016

Keywords

Comments

No other terms below 10^15. - Max Alekseyev, Sep 13 2017

Crossrefs

Solutions to 3^n == k (mod n): A277340 (k=-11), A277289 (k=-7), A277288 (k=-5), A015973 (k=-2), A015949 (k=-1), A067945 (k=1), A276671 (k=2), A276740 (k=5), A277628 (k=6), A277126 (k=7), this sequence (k=8), A277274 (k=11).

Programs

  • PARI
    isok(n) = Mod(3, n)^n == Mod(8, n);

Extensions

a(5)-a(6) established by Max Alekseyev, Sep 13 2017