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.

A333134 Positive integers k such that 11^k == 2 (mod k).

Original entry on oeis.org

1, 3, 413, 1329, 6587, 11629, 75761, 925071199, 9031140861789, 114876097917387, 1314252479257933
Offset: 1

Views

Author

Seiichi Manyama, Mar 20 2020

Keywords

Comments

No other terms below 10^16. Some larger terms: 1584680529929001639, 15598123298097725094806152851164088027801112472240274433891889912569153113. - Max Alekseyev, Jan 07 2025

Crossrefs

Solutions to b^n == 2 (mod n): A015919 (b=2), A276671 (b=3), A130421 (b=4), A124246 (b=5), A277401 (b=7), this sequence (b=11), A116622 (b=13), A333269 (b=17).
Cf. A015960.

Programs

  • PARI
    for(k=1, 1e6, if(Mod(11, k)^k==2, print1(k", ")))

Extensions

a(9)-a(11) from Max Alekseyev, Jan 07 2025