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.

A130422 Numbers k such that 4^k == 3 (mod k).

Original entry on oeis.org

1, 137243, 2517961, 117741349, 369940993, 19049924867, 30861256333, 1087115897989, 38969560049629
Offset: 1

Views

Author

Jon E. Schoenfield, May 26 2007

Keywords

Comments

No other terms below 10^15.
222775558403218644781528238995676668723498240827403019 belongs to this sequence. - Max Alekseyev, Jul 03 2014

Crossrefs

Cf. A130421.

Programs

  • PARI
    for (n=1,10^33, if ( Mod(4,n)^n==3, print1(n,", "))); /* Joerg Arndt, Jun 09 2012 */

Extensions

a(6) from Jon E. Schoenfield, Sep 30 2013
a(7) from Jared Polzer, Oct 03 2013
a(8)-a(9) from Max Alekseyev, Jul 03 2014