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 A097133 #18 Apr 11 2024 17:54:05
%S A097133 1,2,4,5,10,14,25,38,64,101,166,266,433,698,1132,1829,2962,4790,7753,
%T A097133 12542,20296,32837,53134,85970,139105,225074,364180,589253,953434,
%U A097133 1542686,2496121,4038806,6534928,10573733,17108662,27682394,44791057,72473450,117264508
%N A097133 a(n) = 3*Fibonacci(n) + (-1)^n.
%C A097133 Binomial transform is A097134.
%H A097133 Reinhard Zumkeller, <a href="/A097133/b097133.txt">Table of n, a(n) for n = 0..1000</a>
%H A097133 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,2,1).
%F A097133 G.f.: (1+2*x+2*x^2)/((1+x)*(1-x-x^2));
%F A097133 a(n) = 2*a(n-2)+a(n-3);
%F A097133 a(2*n) = 3*F(2*n)+1 = A097136(n).
%t A097133 CoefficientList[Series[(1+2x+2x^2)/((1+x)(1-x-x^2)),{x,0,40}],x] (* or *) LinearRecurrence[{0,2,1},{1,2,4},40] (* _Harvey P. Dale_, May 07 2011 *)
%o A097133 (Haskell)
%o A097133 a097133 n = a097133_list !! n
%o A097133 a097133_list = 1 : 2 : 4 : zipWith (+)
%o A097133 (map (* 2) $ tail a097133_list) a097133_list
%o A097133 -- _Reinhard Zumkeller_, Feb 24 2015
%Y A097133 Cf. A000045, A097134, A097136.
%K A097133 easy,nonn
%O A097133 0,2
%A A097133 _Paul Barry_, Jul 26 2004