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.

A295532 Positive integers n such that 13^n == 8 (mod n).

Original entry on oeis.org

1, 5, 371285, 3957661, 70348567451, 42831939409247
Offset: 1

Views

Author

Max Alekseyev, Nov 23 2017

Keywords

Comments

No other terms below 10^15.

Crossrefs

Sequences 13^n == k (mod n): A116621 (k=1), A116622 (k=2), A116629 (k=3), A116630 (k=4), A116611 (k=5), A116631 (k=6), A116632 (k=7), this sequence (k=8), A116636 (k=9), A116620 (k=10), A116638 (k=11), A116639 (k=15).

Programs

  • Mathematica
    Join[{1, 5}, Select[Range[4000000], PowerMod[13, #, #] == 8 &]] (* Robert Price, Apr 10 2020 *)