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.

A046519 Least n-digit 'happy' prime.

Original entry on oeis.org

7, 13, 103, 1009, 10009, 100003, 1000003, 10000121, 100000039, 1000000009, 10000000033, 100000000003, 1000000000039, 10000000000411, 100000000000067, 1000000000000487, 10000000000000481, 100000000000000003
Offset: 1

Views

Author

Patrick De Geest, Sep 15 1998

Keywords

Comments

Values found by Harvey Heinz and Jud McCranie.

References

  • R. K. Guy, Unsolved Problems Number Theory, Sect. E34.

Crossrefs

Programs

  • Python
    from sympy import nextprime
    def A046519(n):
        m = 10**(n-1)
        while (m:=nextprime(m)):
            k = m
            while k not in {1,37,58,89,145,42,20,4,16}:
                k = sum((0, 1, 4, 9, 16, 25, 36, 49, 64, 81)[ord(d)-48] for d in str(k))
            if k == 1:
                return m # Chai Wah Wu, Aug 02 2023