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 A063092 #32 Mar 18 2023 05:00:22
%S A063092 1,2,13,35,178,563,2521,8714,36445,132299,533194,1988483,7853617,
%T A063092 29726930,116116717,443112947,1720396834,6594639251,25519004425,
%U A063092 98060036186,378769084861,1457429482907,5623889416378,21655613728355,83518397308513,321730148320418
%N A063092 a(0)=1, a(1)=2 and, for n>1, a(n) = a(n-1) + 11*a(n-2).
%C A063092 The binomial transform of this sequence is {(3^n)F(n+1)} where {F(n)} is the Fibonacci sequence A000045.
%H A063092 Harry J. Smith, <a href="/A063092/b063092.txt">Table of n, a(n) for n=0..200</a>
%H A063092 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,11).
%F A063092 G.f.: (1+x)/(1-x-11*x^2). - _Jaume Oliver Lafont_, Sep 07 2009
%F A063092 a(n) = A015447(n) + A015447(n-1), n>0. - _Ralf Stephan_, Jul 21 2013
%F A063092 a(n)^2 - (3*A015447(n-1))^2 - (3*A015447(n-1))*a(n) = (-11)^n. - _Philippe Deléham_, Mar 17 2023
%t A063092 LinearRecurrence[{1,11},{1,2},30] (* _Harvey P. Dale_, Oct 25 2020 *)
%o A063092 (PARI) { for (n=0, 200, if (n>1, a=a1 + 11*a2; a2=a1; a1=a, if (n, a=2; a2=1; a1=2, a=1)); write("b063092.txt", n, " ", a) ) } \\ _Harry J. Smith_, Aug 18 2009
%Y A063092 Cf. A000045.
%K A063092 nonn
%O A063092 0,2
%A A063092 _John W. Layman_, Apr 29 2003