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 A210460 #18 Sep 08 2022 08:46:01
%S A210460 1,2,4,10,23,53,123,285,660,1529,3542,8205,19007,44030,101996,236275,
%T A210460 547334,1267906,2937120,6803875,15761261,36511157,84578549,195927260,
%U A210460 453867933,1051390708,2435559643,5642004185,13069772820,30276291184
%N A210460 Expansion of x*(1+x)/(1-x-2*x^2-2*x^3-x^4).
%C A210460 Transform of Fibonacci numbers based on the triangle A030528.
%H A210460 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,2,1).
%F A210460 a(n) = sum(Fibonacci(k)*binomial(k,n-k), k=floor((n-1)/2)+1..n).
%F A210460 G.f.: x*(1+x)/(1-x-2*x^2-2*x^3-x^4).
%F A210460 a(n) = A123392(n-1)+A123392(n-2). [_Bruno Berselli_, Jan 23 2013]
%t A210460 CoefficientList[Series[(1 + x)/(1 - x - 2 x^2 - 2 x^3 - x^4), {x, 0, 30}], x] (* _Bruno Berselli_, Jan 23 2013 *)
%t A210460 LinearRecurrence[{1,2,2,1},{1,2,4,10},30] (* _Harvey P. Dale_, Mar 28 2015 *)
%o A210460 (Magma) [&+[Fibonacci(k)*Binomial(k,n-k): k in [Floor((n-1)/2)+1..n]]: n in [1..30]]; // _Bruno Berselli_, Jan 23 2013
%Y A210460 Cf. A000045, A030528, A123392.
%K A210460 nonn,easy
%O A210460 1,2
%A A210460 _Perminova Maria_, Jan 22 2013