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 A199763 #19 Mar 26 2025 08:32:46
%S A199763 10,100,1090,11980,131770,1449460,15944050,175384540,1929229930,
%T A199763 21221529220,233436821410,2567805035500,28245855390490,
%U A199763 310704409295380,3417748502249170,37595233524740860,413547568772149450,4549023256493643940,50039255821430083330,550431814035730916620
%N A199763 a(n) = 9*11^n + 1.
%H A199763 Vincenzo Librandi, <a href="/A199763/b199763.txt">Table of n, a(n) for n = 0..900</a>
%H A199763 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-11).
%F A199763 a(n) = 11*a(n-1) - 10.
%F A199763 a(n) = 12*a(n-1) - 11*a(n-2).
%F A199763 G.f.: 10*(1-2*x)/((1-x)*(1-11*x)).
%F A199763 From _Elmo R. Oliveira_, Mar 25 2025: (Start)
%F A199763 E.g.f.: exp(x)*(9*exp(10*x) + 1).
%F A199763 a(n) = 10*A199760(n). (End)
%t A199763 9*11^Range[0,20]+1 (* or *) LinearRecurrence[{12,-11},{10,100},20] (* _Harvey P. Dale_, Sep 06 2021 *)
%o A199763 (Magma) [9*11^n+1: n in [0..30]];
%Y A199763 Cf. A199760.
%K A199763 nonn,easy
%O A199763 0,1
%A A199763 _Vincenzo Librandi_, Nov 10 2011