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”).

A218169
Smallest prime with power closest to having n copies of each digit, with one fewer of 1, 2, 4, 5, 7 or 8.
1
2, 1084357, 558017, 40844333, 9717439, 205807697, 316363037, 14326787, 106741703, 931524977, 227145983, 7031729687, 7284563827, 52156681, 7914854663
OFFSET
1,1
COMMENTS
The powers for the terms so far are 29, 3, 5, 5, 7, 7, 8, 11, 11, 11, 13, 12, 13, 18 and 15. A218170 is the opposing sequence with an extra copy of some digit. The 3-divisibility criterion precludes all digits appearing equally frequently. A217368 deals with the case not limited to primes.
EXAMPLE
2^29 = 536870912, missing a copy of the digit 4.
CROSSREFS
Sequence in context: A170996 A051118 A324439 * A168535 A303433 A253264
KEYWORD
nonn,base
AUTHOR
James G. Merickel, Oct 22 2012
STATUS
approved