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 A192108 #15 Jan 05 2013 15:26:49 %S A192108 1,100010101110,212020020002101000,33302203023130111130130130, %T A192108 142330104010234210234210234210234210, %U A192108 10225201200453221555314535245115155324023111430,5152124535261564540656541032335232432112241035404402500510 %N A192108 a(1)=1; for n>1, a(n) = n*(10^(n^2)-1)/9 written in base n. %C A192108 For n = 2 through 9, this is the decimal number with n^2 digits all equal to n, then written in base n. For n>9 the reader has to separate the "digits" himself (so this is a fairly unsatisfactory sequence). %C A192108 This is to A191244 as n^2 is to n. %e A192108 For n=3: form the number with 3^2 = 9 digits all equal to 3, 333333333. This is then converted into base 3, to get 212020020002101000. %p A192108 f:=n->n*(10^(n^2)-1)/9; %p A192108 g:=n->convert(f(n),base,n); %p A192108 for n from 2 to 20 do %p A192108 t1:=g(n); %p A192108 t2:=nops(t1); %p A192108 lprint( [seq(t1[t2+1-i],i=1..t2)]); %p A192108 od: %Y A192108 Cf. A191244. %K A192108 nonn,easy,base %O A192108 1,2 %A A192108 _Jonathan Vos Post_, Dec 31 2012 %E A192108 Edited by _N. J. A. Sloane_, Jan 05 2013