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!)
 A217565 With r and s successive primes, the first prime p that with its successor q that gives prime counts of all ten base-10 digits for the expression (q^r)*(p^s). 0
 33581, 673, 571, 1987, 915199, 441799, 2115761, 961943, 15406687, 77123341, 4098427, 5526679, 54560189, 22291639, 371594479 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This reverses the idea for A217049, with the smaller of successive primes being raised to the larger prime power. See that sequence for motivation. LINKS EXAMPLE (677^3)*(673^5) is the value corresponding to a(2).  What this means is that the decimal representation of this number has a prime number of copies of each digit and no pair of successive primes in the same order and smaller than {673,677} has the same characteristic. CROSSREFS Cf. A217049. Sequence in context: A235678 A235448 A236197 * A142587 A116496 A235667 Adjacent sequences:  A217562 A217563 A217564 * A217566 A217567 A217568 KEYWORD nonn,base AUTHOR James G. Merickel, Oct 06 2012 EXTENSIONS a(15) added by James G. Merickel, Oct 17 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 April 7 01:03 EDT 2020. Contains 333291 sequences. (Running on oeis4.)