|
|
A216873
|
|
Numbers n such that 2^n in decimal has at least 9 of the digits 0-9 appearing a prime number of times.
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This is a subsequence of A216872, which has 8 in place of 9. See that sequence for more comments and a PARI/GP program.
|
|
LINKS
|
|
|
PROG
|
(Python)
from sympy import isprime
for i in range(2*10**6):
s = str(n)
if sum(isprime(s.count(d)) for d in '0123456789') >= 9:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|