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 A049656 #21 Sep 08 2022 08:44:58
%S A049656 4,203,9552,448756,21081995,990405024,46527954148,2185823439947,
%T A049656 102687173723376,4824111341558740,226630545879537419,
%U A049656 10646811544996699968,500173512068965361092,23497508255696375271371,1103882714505660672393360,51858990073510355227216564
%N A049656 a(n) = (F(8n+7)-1)/3, where F=A000045 (the Fibonacci sequence).
%H A049656 Colin Barker, <a href="/A049656/b049656.txt">Table of n, a(n) for n = 0..500</a>
%H A049656 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (48,-48,1).
%F A049656 G.f.: ( -4-11*x ) / ( (x-1)*(x^2-47*x+1) ). - _R. J. Mathar_, Oct 26 2015
%F A049656 a(n) = (-1+((94+42*sqrt(5))^(-n)*(4^n*(1+sqrt(5))+2*(47+21*sqrt(5))^(2*n)*(682+305*sqrt(5))))/(105+47*sqrt(5)))/3. - _Colin Barker_, Mar 06 2016
%F A049656 a(n) = 47*a(n-1)-a(n-2)+15. - _Vincenzo Librandi_, Mar 06 2016
%t A049656 (Fibonacci[8Range[0,20]+7]-1)/3 (* _Harvey P. Dale_, Sep 21 2011 *)
%t A049656 RecurrenceTable[{a[0] == 4, a[1] == 203, a[n] == 47 a[n-1] - a[n-2] + 15}, a, {n, 30}] (* _Vincenzo Librandi_, Mar 06 2016 *)
%o A049656 (PARI) Vec((-4-11*x)/((x-1)*(x^2-47*x+1)) + O(x^25)) \\ _Colin Barker_, Mar 06 2016
%o A049656 (Magma) I:=[4,203]; [n le 2 select I[n] else 47*Self(n-1)-Self(n-2)+15: n in [1..30]]; // _Vincenzo Librandi_, Mar 06 2016
%Y A049656 Cf. A049655, A049686.
%K A049656 nonn,easy
%O A049656 0,1
%A A049656 _Clark Kimberling_