This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A323604 #24 Jan 25 2019 03:26:14 %S A323604 102756,10013236879,1000112354597667 %N A323604 Smallest m such that each digit (0-9) appears exactly n times in the concatenation of m and pi(m). %H A323604 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 A323604 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 A323604 Cf. A000040, A000720, A050278, A322828. %K A323604 nonn,base,hard,bref,more %O A323604 1,1 %A A323604 _G. L. Honaker, Jr._, Jan 19 2019