|
|
A046519
|
|
Least n-digit 'happy' prime.
|
|
5
|
|
|
7, 13, 103, 1009, 10009, 100003, 1000003, 10000121, 100000039, 1000000009, 10000000033, 100000000003, 1000000000039, 10000000000411, 100000000000067, 1000000000000487, 10000000000000481, 100000000000000003
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems Number Theory, Sect. E34.
|
|
LINKS
|
|
|
PROG
|
(Python)
from sympy import nextprime
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:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|