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

 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
 3164252736, 258479, 69636, 15165, 3123, 1019, 1315, 815, 307, 205, 475, 347, 143, 151, 272, 1388, 618, 245, 12080, 48, 8635, 23, 287467, 17, 23118, 8440, 48387, 127009, 65457, 70662, 13181, 42911, 4965, 162192, 14460, 226994, 12, 55853, 4104749, 2674855 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS EXAMPLE 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. CROSSREFS Cf. A216855. Sequence in context: A291600 A092380 A096566 * A198863 A199630 A198298 Adjacent sequences:  A217048 A217049 A217050 * A217052 A217053 A217054 KEYWORD nonn,base AUTHOR James G. Merickel, Sep 25 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.

Last modified July 24 11:17 EDT 2021. Contains 346273 sequences. (Running on oeis4.)