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 A049676 #27 Sep 08 2022 08:44:58
%S A049676 1,41,1926,90481,4250681,199691526,9381251041,440719107401,
%T A049676 20704416796806,972666870342481,45694638489299801,2146675342126748166,
%U A049676 100848046441467864001,4737711507406862859881,222571592801681086550406,10456127150171604205009201
%N A049676 a(n) = (F(8*n+3) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).
%H A049676 Indranil Ghosh, <a href="/A049676/b049676.txt">Table of n, a(n) for n = 0..596</a>
%H A049676 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A049676 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (47,-1).
%F A049676 From _Philippe Deléham_, Nov 18 2008: (Start)
%F A049676 a(n) = 47*a(n-1) - a(n-2), a(0)=1, a(1)=41.
%F A049676 G.f.: (1-6*x)/(1-47*x+x^2). (End)
%e A049676 a(2) = (F(8 * 2 + 3) + F(8 * 2 + 1)) / 3 = (F(19) + F(17)) / 3 = (4181 + 1597) / 3 = 5778 / 3 = 1926. - _Indranil Ghosh_, Feb 04 2017
%t A049676 Table[(Fibonacci[8*n + 3] + Fibonacci[8*n + 1])/3, {n, 0, 20}] (* _Wesley Ivan Hurt_, Feb 04 2017 *)
%t A049676 LinearRecurrence[{47,-1}, {1,41}, 30] (* _G. C. Greubel_, Dec 02 2017 *)
%o A049676 (PARI) for(n=0,30, print1((fibonacci(8*n + 3) + fibonacci(8*n + 1))/3, ", ")) \\ _G. C. Greubel_, Dec 02 2017
%o A049676 (Magma) [(Fibonacci(8*n + 3) + Fibonacci(8*n + 1))/3: n in [0..30]]; // _G. C. Greubel_, Dec 02 2017
%Y A049676 Cf. A000045.
%K A049676 nonn,easy
%O A049676 0,2
%A A049676 _Clark Kimberling_
%E A049676 More terms from _Indranil Ghosh_, Feb 04 2017