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 A049654 #19 Feb 18 2024 03:36:58
%S A049654 0,11,532,25008,1174859,55193380,2592914016,121811765387,
%T A049654 5722560059188,268838511016464,12629687457714635,593326472001571396,
%U A049654 27873714496616140992,1309471254868957055243,61517275264344365455444
%N A049654 a(n) = (F(8*n+1) - 1)/3 where F=A000045 (the Fibonacci sequence).
%H A049654 G. C. Greubel, <a href="/A049654/b049654.txt">Table of n, a(n) for n = 0..595</a>
%H A049654 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (48,-48,1).
%F A049654 From _R. J. Mathar_, Oct 26 2015: (Start)
%F A049654 G.f.: -x*(11+4*x) / ( (x-1)*(x^2-47*x+1) ).
%F A049654 a(n) = 11*|A156093(n)|+4*|A156093(n-1)|. (End)
%t A049654 LinearRecurrence[{48, -48, 1}, {0, 11, 532}, 50] (* or *) Table[( Fibonacci[8*n+1]-1)/3, {n,0,30}] (* _G. C. Greubel_, Dec 02 2017 *)
%t A049654 CoefficientList[Series[-x(11+4x)/((x-1)(x^2-47*x+1)),{x,0,14}],x] (* _Stefano Spezia_, Feb 18 2024 *)
%o A049654 (PARI) for(n=0,30, print1((fibonacci(8*n+1) - 1)/3, ", ")) \\ _G. C. Greubel_, Dec 02 2017
%o A049654 (Magma) [(Fibonacci(8*n+1) - 1)/3: n in [0..30]]; // _G. C. Greubel_, Dec 02 2017
%Y A049654 Cf. A000045, A156093.
%K A049654 nonn,easy
%O A049654 0,2
%A A049654 _Clark Kimberling_