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 A133219 #12 Feb 22 2024 19:33:24 %S A133219 1010100,2200100,20130000,3243003420,55111253530,5411665056000, %T A133219 33254100107730,210324811482600,977731833235239280 %N A133219 Smallest composite integer in base n which remains composite after altering any one or two digits. %C A133219 Changing the most significant digit to 0 is allowed. The problem (base 10) was posed by W. Sierpinski, published in 1977. There are an infinite number of solutions if a certain Erdos conjecture on congruences is true. a(2) through a(9) are proved minimal, a(10) has not yet been proved minimal. %H A133219 Witold Jarnicki and Maciej Zenczykowski, <a href="http://arXiv.org/abs/0709.3361">On a property of the number 977731833235239280</a>, arXiv:0709.3361 [math.NT], 2007 %e A133219 a(3) base 10 = 1953. a(4) base 10 = 34560. a(5) base 10 = 7000485. a(6) base 10 = 354748446. a(7) base 10 = 77478704205. a(8) base 10 = 1878528135128. a(9) base 10 = 48398467146642. %Y A133219 Cf. A220289. %K A133219 base,more,nonn %O A133219 2,1 %A A133219 _Jonathan Vos Post_, Oct 11 2007 %E A133219 a(2) and the definition were corrected by Witold Jarnicki, Oct 11 2007