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 A105280 #31 May 24 2025 16:22:39
%S A105280 0,11,132,1463,16104,177155,1948716,21435887,235794768,2593742459,
%T A105280 28531167060,313842837671,3452271214392,37974983358323,
%U A105280 417724816941564,4594972986357215,50544702849929376,555991731349223147,6115909044841454628,67274999493256000919,740024994425816010120
%N A105280 a(0)=0; a(n) = 11*a(n-1) + 11.
%H A105280 Harvey P. Dale, <a href="/A105280/b105280.txt">Table of n, a(n) for n = 0..960</a>
%H A105280 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-11).
%F A105280 a(n) = 11^n + a(n-1) (with a(0)=0). - _Vincenzo Librandi_, Nov 13 2010
%F A105280 From _Elmo R. Oliveira_, May 24 2025: (Start)
%F A105280 G.f.: 11*x/((x-1)*(11*x-1)).
%F A105280 E.g.f.: 11*exp(x)*(exp(10*x) - 1)/10.
%F A105280 a(n) = 11*(11^n - 1)/10.
%F A105280 a(n) = 12*a(n-1) - 11*a(n-2).
%F A105280 a(n) = A016123(n) - 1. (End)
%p A105280 a:=n-> add(11^j,j=1..n): seq(a(n),n=0..12); # _Zerinvary Lajos_, Oct 03 2007
%t A105280 NestList[11#+11&,0,20] (* or *) LinearRecurrence[{12,-11},{0,11},20] (* _Harvey P. Dale_, Dec 02 2023 *)
%Y A105280 Cf. A000918, A016123, A029858, A052379, A052386, A080674.
%Y A105280 Row n=11 of A228275.
%K A105280 base,easy,nonn
%O A105280 0,2
%A A105280 _Alexandre Wajnberg_, Apr 25 2005
%E A105280 Corrected by _T. D. Noe_, Nov 07 2006