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 A024127 #33 Jul 08 2025 17:28:13
%S A024127 0,10,120,1330,14640,161050,1771560,19487170,214358880,2357947690,
%T A024127 25937424600,285311670610,3138428376720,34522712143930,
%U A024127 379749833583240,4177248169415650,45949729863572160,505447028499293770
%N A024127 a(n) = 11^n-1.
%C A024127 In base 11 these are 0, A, AA, AAA, ... - _David Rabahy_, Dec 12 2016
%H A024127 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-11).
%F A024127 G.f.: 1/(1-11*x)-1/(1-x). - _Mohammad K. Azarian_, Jan 14 2009
%F A024127 E.g.f.: e^(11*x)-e^x. - _Mohammad K. Azarian_, Jan 14 2009
%F A024127 a(n) = 11*a(n-1)+10 for n>0, a(0)=0. - _Vincenzo Librandi_, Nov 19 2010
%F A024127 a(n) = Sum_{i=1..n} 10^i*binomial(n,n-i) for n>0, a(0)=0. - _Bruno Berselli_, Nov 11 2015
%F A024127 a(n) = A001020(n) - 1. - _Sean A. Irvine_, Jun 19 2019
%t A024127 LinearRecurrence[{12, -11},{0, 10},18] (* _Ray Chandler_, Aug 26 2015 *)
%o A024127 (PARI) a(n)=11^n-1 \\ _Charles R Greathouse IV_, Dec 12 2016
%Y A024127 Cf. A001020.
%K A024127 nonn,easy
%O A024127 0,2
%A A024127 _N. J. A. Sloane_