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.

A128126 Numbers k such that 2^k == 18 (mod k).

Original entry on oeis.org

1, 2, 14, 35, 77, 98, 686, 1715, 5957, 18995, 26075, 43921, 49901, 52334, 86555, 102475, 221995, 250355, 1228283, 1493597, 4260059, 6469715, 10538675, 15374219, 19617187, 22731275, 53391779, 60432239, 68597795, 85672139, 175791077
Offset: 1

Views

Author

Alexander Adamchuk, Feb 15 2007

Keywords

Crossrefs

Cf. A015910, A036236, A050259 (numbers k such that 2^k == 3 (mod k)), A033981, A051447, A033982, A051446, A033983, A128121, A128122, A128123, A128124, A128125.

Programs

  • Magma
    [1,2,14] cat [n: n in [1..10^8] | Modexp(2, n, n) eq 18]; // Vincenzo Librandi, Apr 05 2019
  • Mathematica
    m = 18; Join[Select[Range[m], Divisible[2^# - m, #] &],
    Select[Range[m + 1, 10^6], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 08 2018 *)
    Join[{1,2,14},Select[Range[86*10^6],PowerMod[2,#,#]==18&]] (* Harvey P. Dale, Feb 23 2025 *)
  • PARI
    isok(n) = Mod(2, n)^n == 18; \\ Michel Marcus, Oct 09 2018
    

Extensions

More terms from Joe Crump (joecr(AT)carolina.rr.com), Mar 04 2007
1, 2 and 14 added by N. J. A. Sloane, Apr 23 2007