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.

A051446 Integers n such that 2^n == 13 (mod n).

Original entry on oeis.org

1, 11, 95, 4834519, 156203641, 135466795859, 182901372149135
Offset: 1

Views

Author

Joe K. Crump (joecr(AT)carolina.rr.com)

Keywords

Comments

No other terms below 10^15.
Larger terms: 1910102794991114096035717. - Max Alekseyev, May 18 2011

Crossrefs

Programs

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

Extensions

Terms 1, 11 prepended by Max Alekseyev, May 18 2011
a(7) added by Sergey Paramonov, Sep 05 2021