login
Smallest m such that each digit (0-9) appears exactly n times in the concatenation of m and pi(m).
0

%I #24 Jan 25 2019 03:26:14

%S 102756,10013236879,1000112354597667

%N Smallest m such that each digit (0-9) appears exactly n times in the concatenation of m and pi(m).

%H Carlos Rivera, <a href="https://www.primepuzzles.net/problems/prob_071.htm">Problem 71: n & pi(n) such that ...</a>, The Prime Puzzles & Problems Connection.

%e a(2) = 10013236879 because each digit (0-9) appears exactly 2 times in the equation pi(10013236879) = 455627894 and this is the smallest case.

%Y Cf. A000040, A000720, A050278, A322828.

%K nonn,base,hard,bref,more

%O 1,1

%A _G. L. Honaker, Jr._, Jan 19 2019