login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
88, 104, 113, 114, 120, 141
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.
No other terms below 5*10^6. - James G. Merickel, Dec 29 2015
PROG
(Python)
from sympy import isprime
A216873_list, n = [], 1
for i in range(2*10**6):
s = str(n)
if sum(isprime(s.count(d)) for d in '0123456789') >= 9:
A216873_list.append(i)
n *= 2 # Chai Wah Wu, Nov 12 2015
CROSSREFS
Cf. A216872.
Sequence in context: A356368 A068356 A215830 * A114166 A350324 A183186
KEYWORD
nonn,base,hard,more
AUTHOR
James G. Merickel, Sep 18 2012
STATUS
approved