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 A110369 #26 Aug 03 2025 04:55:06
%S A110369 2,13,114,1115,11116,111117,1111118,11111119,111111120,1111111121,
%T A110369 11111111122,111111111123,1111111111124,11111111111125,
%U A110369 111111111111126,1111111111111127,11111111111111128,111111111111111129,1111111111111111130
%N A110369 (Digit 1 repeated n times) + n.
%C A110369 Partial sums of A062397. - _Klaus Purath_, Mar 18 2021
%H A110369 Harvey P. Dale, <a href="/A110369/b110369.txt">Table of n, a(n) for n = 1..1000</a>
%F A110369 a(n) = A002275(n) + n. - _Michel Marcus_, Mar 04 2018
%F A110369 a(n) = (10^n - 1)/9 + n. - _Klaus Purath_, Mar 18 2021
%e A110369 a(12) = 111111111111 + 12 = 111111111123.
%t A110369 Table[FromDigits[PadRight[{},n,1]]+n,{n,20}] (* _Harvey P. Dale_, May 15 2019 *)
%o A110369 (Sage) [gaussian_binomial(n,1,10)+n for n in range(1,20)] # _Zerinvary Lajos_, May 29 2009
%Y A110369 Cf. A002275 (repunits).
%K A110369 base,easy,nonn
%O A110369 1,1
%A A110369 _Amarnath Murthy_, Jul 24 2005
%E A110369 More terms from _Joshua Zucker_, May 08 2006
%E A110369 An incorrect recurrence was deleted by _N. J. A. Sloane_, Sep 13 2009