A323604 Smallest m such that each digit (0-9) appears exactly n times in the concatenation of m and pi(m).
102756, 10013236879, 1000112354597667
Offset: 1
Examples
a(2) = 10013236879 because each digit (0-9) appears exactly 2 times in the equation pi(10013236879) = 455627894 and this is the smallest case.
Links
- Carlos Rivera, Problem 71: n & pi(n) such that ..., The Prime Puzzles & Problems Connection.