login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

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
101723, 4697081, 1361471, 5772427, 18168923, 35514203, 562489981, 780433519, 1006447529, 228344981, 10187739647, 1951104049, 496920113, 2246645239, 2596274977, 10431345763, 2862382343 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..17.

EXAMPLE

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.

CROSSREFS

Cf. A218169, A217368.

Sequence in context: A187642 A023077 A077760 * A153050 A203592 A106813

Adjacent sequences:  A218167 A218168 A218169 * A218171 A218172 A218173

KEYWORD

nonn,base

AUTHOR

James G. Merickel, Oct 22 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 22:48 EST 2020. Contains 338897 sequences. (Running on oeis4.)