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 A090730 #30 Mar 08 2022 20:44:27
%S A090730 2,22,482,10582,232322,5100502,111978722,2458431382,53973511682,
%T A090730 1184958825622,26015120652002,571147695518422,12539234180753282,
%U A090730 275292004281053782,6043884860002429922,132690174915772404502
%N A090730 a(n) = 22*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 22.
%H A090730 Indranil Ghosh, <a href="/A090730/b090730.txt">Table of n, a(n) for n = 0..743</a>
%H A090730 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A090730 <a href="/index/Rea#recur1">Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)</a>
%H A090730 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (22,-1).
%F A090730 a(n) = p^n + q^n, where p = 11 + 2*sqrt(30) and q = 11 - 2*sqrt(30). - _Tanya Khovanova_, Feb 06 2007
%F A090730 G.f.: (2-22*x)/(1-22*x+x^2). - _Philippe Deléham_, Nov 18 2008
%F A090730 a(n) = 2*A077422(n). - _R. J. Mathar_, Sep 27 2014
%t A090730 a[0] = 2; a[1] = 22; a[n_] := 22a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 15}] (* _Robert G. Wilson v_, Jan 30 2004 *)
%t A090730 LinearRecurrence[{22,-1},{2,22},20] (* _Harvey P. Dale_, Mar 07 2018 *)
%o A090730 (Sage) [lucas_number2(n,22,1) for n in range(0,20)] # _Zerinvary Lajos_, Jun 26 2008
%Y A090730 Cf. A008951, A016005, A001613, A077422.
%K A090730 easy,nonn
%O A090730 0,1
%A A090730 Nikolay V. Kosinov (kosinov(AT)unitron.com.ua), Jan 18 2004