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!)
A217051 Smallest k such that the number k^n in its decimal representation has a prime number of copies of the digit d for each d from 0 through 9. 0

%I #16 Apr 06 2020 19:03:05

%S 3164252736,258479,69636,15165,3123,1019,1315,815,307,205,475,347,143,

%T 151,272,1388,618,245,12080,48,8635,23,287467,17,23118,8440,48387,

%U 127009,65457,70662,13181,42911,4965,162192,14460,226994,12,55853,4104749,2674855

%N Smallest k such that the number k^n in its decimal representation has a prime number of copies of the digit d for each d from 0 through 9.

%e 23^23 = 20880467999847912034355032910567 has a prime number of copies of each digit (two 1's and two 6's; three 2's, 3's, 4's, 5's, 7's and 8's; and five each of 9's and 0's), and no k < 23 is such that k^23 has this property.

%Y Cf. A216855.

%K nonn,base

%O 2,1

%A _James G. Merickel_, Sep 25 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 18:43 EDT 2024. Contains 371765 sequences. (Running on oeis4.)