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 A102901 #25 Dec 10 2022 01:27:22
%S A102901 1,0,6,6,42,78,330,798,2778,7566,24234,69630,215034,632814,1923018,
%T A102901 5719902,17258010,51577422,155125482,464590014,1395342906,4182882990,
%U A102901 12554940426,37652238366,112981880922,338895311118,1016786596650
%N A102901 a(n) = a(n-1) + 6*a(n-2), a(0)=1, a(1)=0.
%C A102901 Binomial transform is A102900.
%C A102901 Hankel transform is = 1,6,0,0,0,0,0,0,0,0,0,0,... - _Philippe Deléham_, Nov 02 2008
%D A102901 Maria Paola Bonacina and Nachum Dershowitz, Canonical Inference for Implicational Systems, in Automated Reasoning, Lecture Notes in Computer Science, Volume 5195/2008, Springer-Verlag.
%H A102901 Vincenzo Librandi, <a href="/A102901/b102901.txt">Table of n, a(n) for n = 0..1000</a>
%H A102901 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,6).
%F A102901 G.f.: (1-x)/((1+2*x)*(1-3*x)).
%F A102901 a(n) = (2*3^n + 3*(-2)^n)/5.
%F A102901 a(n) = 6*A015441(n-1), for n>0.
%e A102901 a(6) = 330; (2*3^6 + 3*(-2)^6)/5 = (1458 + 192)/5 = 330.
%p A102901 A102901:=n->(2*3^n+3*(-2)^n)/5; seq(A102901(k), k=0..60); # _Wesley Ivan Hurt_, Nov 05 2013
%t A102901 CoefficientList[Series[(1-x)/((1+2x)(1-3x)), {x,0,50}], x] (* _Vincenzo Librandi_, Jul 20 2013 *)
%o A102901 (Magma) [(2*3^n+3*(-2)^n)/5: n in [0..50]]; // _Vincenzo Librandi_, Jul 20 2013
%o A102901 (PARI) a(n)=([0,1; 6,1]^n*[1;0])[1,1] \\ _Charles R Greathouse IV_, Mar 28 2016
%o A102901 (SageMath)
%o A102901 A102901=BinaryRecurrenceSequence(1,6,1,0)
%o A102901 [A102901(n) for n in range(51)] # _G. C. Greubel_, Dec 09 2022
%Y A102901 Cf. A015441, A102900.
%K A102901 easy,nonn
%O A102901 0,3
%A A102901 _Paul Barry_, Jan 17 2005