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.

A015940 Positive integers n such that 2^n == -3 (mod n).

Original entry on oeis.org

1, 5, 917, 3223, 62911, 326329, 395819, 33504053, 4446226763, 17556128765, 141613728437, 5259417592253, 113837290408523
Offset: 1

Views

Author

Keywords

Comments

No other terms below 10^16.
Larger term: 18468744643735483963902321985787. - Max Alekseyev, Aug 01 2011

Crossrefs

Cf. A050259.

Programs

  • Mathematica
    Do[ If[ PowerMod[ 2, n, n ] + 3 == n, Print[n]], { n, 1, 10^9, 2 } ]

Extensions

Corrected and extended by Olivier Wittenberg, May 23 2004.
a(10)-a(13) from Max Alekseyev, Aug 01 2011