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 A027938 #20 Sep 08 2022 08:44:49
%S A027938 1,16,92,365,1204,3588,10093,27476,73440,194345,511576,1342936,
%T A027938 3520457,9222440,24151764,63238773,165571628,433484476,1134891605,
%U A027938 2971201740,7778726776
%N A027938 a(n) = T(2n, n+2), T given by A027935.
%H A027938 G. C. Greubel, <a href="/A027938/b027938.txt">Table of n, a(n) for n = 2..1000</a>
%H A027938 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (7,-19,26,-19,7,-1).
%F A027938 G.f.: x^2*(1+9*x-x^2-x^3) / ((1-x)^4*(1-3*x+x^2)). - _Colin Barker_, Dec 10 2015
%F A027938 a(n) = Fibonacci(2*n+5) - (4*n^3 + 6*n^2 + 14*n + 15)/3. - _G. C. Greubel_, Sep 28 2019
%p A027938 with(combinat); seq(fibonacci(2*n+5) - (4*n^3 +6*n^2 +14*n +15)/3, n=2..30); # _G. C. Greubel_, Sep 28 2019
%t A027938 Table[Fibonacci[2*n+5] -(4*n^3 +6*n^2 +14*n +15)/3, {n,2,30}] (* _G. C. Greubel_, Sep 28 2019 *)
%o A027938 (PARI) vector(30, n, my(m=n+1); fibonacci(2*m+5) - (4*m^3 +6*m^2 +14*m +15)/3) \\ _G. C. Greubel_, Sep 28 2019
%o A027938 (Magma) [Fibonacci(2*n+5) - (4*n^3 +6*n^2 +14*n +15)/3: n in [2..30]]; // _G. C. Greubel_, Sep 28 2019
%o A027938 (Sage) [fibonacci(2*n+5) - (4*n^3 +6*n^2 +14*n +15)/3 for n in (2..30)] # _G. C. Greubel_, Sep 28 2019
%o A027938 (GAP) List([2..30], n-> Fibonacci(2*n+5) - (4*n^3 +6*n^2 +14*n +15)/3 ); # _G. C. Greubel_, Sep 28 2019
%Y A027938 Cf. A000045, A027935.
%K A027938 nonn,easy
%O A027938 2,2
%A A027938 _Clark Kimberling_