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 A373963 #11 Jun 24 2024 08:47:16
%S A373963 0,0,1,4,10,20,35,57,94,175,385,935,2289,5385,12031,25686,53176,
%T A373963 108699,223215,465867,991088,2138884,4643816,10067197,21695156,
%U A373963 46427790,98807200,209689343,444983081,946084386,2016738335,4308708305,9217134511,19720875625
%N A373963 Number of compositions of 6*n-3 into parts 5 and 6.
%H A373963 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-15,20,-15,7,-1).
%F A373963 a(n) = A017837(6*n-3).
%F A373963 a(n) = Sum_{k=0..floor(n/5)} binomial(n+k,n-3-5*k).
%F A373963 a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 7*a(n-5) - a(n-6).
%F A373963 G.f.: x^3*(1-x)^2/((1-x)^6 - x^5).
%F A373963 a(n) = A373964(n+1) - A373964(n).
%o A373963 (PARI) a(n) = sum(k=0, n\5, binomial(n+k, n-3-5*k));
%Y A373963 Cf. A107025, A369794, A373961, A373962, A373964.
%Y A373963 Cf. A017837.
%K A373963 nonn,easy
%O A373963 1,4
%A A373963 _Seiichi Manyama_, Jun 24 2024