login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218170 Smallest prime with power closest to having all digits n times, with one more of 1, 2, 4, 5, 7 or 8. 1

%I #20 Nov 26 2012 13:47:25

%S 101723,4697081,1361471,5772427,18168923,35514203,562489981,780433519,

%T 1006447529,228344981,10187739647,1951104049,496920113,2246645239,

%U 2596274977,10431345763,2862382343

%N Smallest prime with power closest to having all digits n times, with one more of 1, 2, 4, 5, 7 or 8.

%C Like A218169 but with an extra copy, rather than one less copy, of some digit. The exponents here are 2, 3, 5, 6, 7, 8, 8, 9, 10, 12, 11, 13, 15, 15, 16, 16 and 18. A217368 holds the sequence for powers of composites -- necessarily -- with equal counts of all digits.

%e Unlike the parallel sequence, with 2^29 being a digit shy of having exactly one of each digit, the smallest prime to have a power with two copies of some digit and one of all others is 101723, whose square is 10347568729.

%Y Cf. A218169, A217368.

%K nonn,base

%O 1,1

%A _James G. Merickel_, Oct 22 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)