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.

A362966 Numbers k such that A007908(k) == 1 (mod k).

Original entry on oeis.org

1, 121487, 293957, 13449179, 549999887
Offset: 1

Views

Author

Max Alekseyev, Jun 06 2023

Keywords

Comments

a(6) > 10^11. - Jason Yuen, Oct 12 2024

Crossrefs

Programs

  • Python
    # See A029455 for concat_mod
    def isok(k): return concat_mod(10, k, k)==1%k # Jason Yuen, Oct 12 2024