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.

A033982 Integers n such that 2^n == 11 (mod n).

Original entry on oeis.org

1, 3, 262279, 143823239, 382114303, 1223853491, 381541784791, 556985326431, 6236258437049, 98828020264153
Offset: 1

Views

Author

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

Keywords

Comments

894157816841269897394424491194255510200782699 belongs to this sequence. [From Max Alekseyev]

Crossrefs

Programs

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

Extensions

Edited by N. J. A. Sloane, Jul 03 2008 at the suggestion of R. J. Mathar
Terms 1, 3 prepended by Max Alekseyev, May 18 2011
a(9), a(10) from Max Alekseyev, Jul 30 2011