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.

Showing 1-1 of 1 results.

A321365 Positive integers n such that 13^n == 14 (mod n).

Original entry on oeis.org

1, 5805311, 392908759, 399614833907, 2674764845549, 21997277871211, 67146783889057
Offset: 1

Views

Author

Max Alekseyev, Nov 08 2018

Keywords

Comments

No other terms below 10^15.

Crossrefs

Solutions to 13^n == k (mod n): A001022 (k=0), A015963 (k=-1), A116621 (k=1), A116622 (k=2), A116629 (k=3), A116630 (k=4), A116611 (k=5), A116631 (k=6), A116632 (k=7), A295532 (k=8), A116636 (k=9), A116620(k=10), A116638 (k=11), A321364 (k=12), this sequence (k=14), A116639 (k=15).
Cf. A116609, A127821, A128149, A128172.

Programs

Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.