|
%I #18 Nov 01 2012 16:10:58
%S 2,1084357,558017,40844333,9717439,205807697,316363037,14326787,
%T 106741703,931524977,227145983,7031729687,7284563827,52156681,
%U 7914854663
%N Smallest prime with power closest to having n copies of each digit, with one fewer of 1, 2, 4, 5, 7 or 8.
%C 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.
%e 2^29 = 536870912, missing a copy of the digit 4.
%Y Cf. A218170, A217368.
%K nonn,base
%O 1,1
%A _James G. Merickel_, Oct 22 2012
|
