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.

A337828 Odd integers k such that 3^((k-1)/2) + 1 == 0 (mod k*(k-1)/2).

Original entry on oeis.org

5, 101, 62501, 1020101, 31562501, 139476101, 637562501, 789062501, 985502501, 2656262501, 7455062501, 19726562501, 53662562501
Offset: 1

Views

Author

Benoit Cloitre, Sep 24 2020

Keywords

Comments

Computed terms are prime.

Crossrefs

Cf. A337818.

Programs

  • Mathematica
    Select[Range[3, 3*10^7, 2], PowerMod[3, (# - 1)/2, (t = #*(# - 1)/2)] == t - 1 &] (* Amiram Eldar, Sep 24 2020 *)

Extensions

a(7)-a(13) from Amiram Eldar, Sep 25 2020