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 A057883 #8 Apr 03 2023 10:36:09 %S A057883 23,137,6173,37019,5600239,476710937,8192454631,1645957688093, %T A057883 78456580281239 %N A057883 Smallest possible prime with at least n (from 2 to 10) distinct digits that remains prime (leading zeros not allowed) when all occurrences of its digits d are deleted. %H A057883 C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_110.htm">PrimePuzzle 110</a> %H A057883 C. K. Caldwell, <a href="https://t5k.org/curios/page.php?short=5600239">Prime Curios! 5600239</a> %H A057883 C. K. Caldwell, <a href="https://t5k.org/curios/page.php?short=476710937">Prime Curios! 476710937</a>. %e A057883 5600239 is a solution for at least 6 digits because 56239, 560039, 560029, 600239, 500239 and 560023 are all primes. %Y A057883 Cf. A057876-A057882, A051362, A034302-A034305. %K A057883 nonn,base,fini,full %O A057883 2,1 %A A057883 _Patrick De Geest_, Oct 15 2000 %E A057883 More terms from _Giovanni Resta_, Feb 15 2006