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 A122873 #2 Mar 30 2012 17:35:16 %S A122873 0,0,1,0,1,4,0,1,3,7,0,1,6,4,2,0,1,7,3,2,14,0,1,3,11,2,6,12,0,1,4,5,2, %T A122873 13,7,11,0,1,10,91,2,7,28,4,20,0,1,11,111,2,5,4,24,9,3,0,1,12,5,2,4, %U A122873 26,9,24,3,19,0,1,5,6,2,8,19,32,10,3,11,40,0,1,14,4,2,24,9,35,28,3,6,12,5 %N A122873 Triangle T(n,k) = smallest number whose square has largest digit k in base n, 0<=k<n. %C A122873 Repunits in base n are an upper bound, since 11...11^2 = 12...(k)...21 in any sufficiently large base. %e A122873 Row 10: 0,1,11,111,2,5,4,24,9,3, has squares 0,1,121,12321,4,25,16,576,81,9, with digits 0,...,9 as the respective largest digits. %Y A122873 Cf. A055129, A000290, A054055. %K A122873 base,nonn,tabl %O A122873 1,6 %A A122873 _Franklin T. Adams-Watters_, Oct 23 2006