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 A379703 #13 Jan 02 2025 12:47:40
%S A379703 0,0,0,6,18,31,57,80,125,161,230,282,380,451,583,676,847,965,1180,
%T A379703 1326,1590,1767,2085,2296,2673,2921,3362,3650,4160,4491,5075,5452,
%U A379703 6115,6541,7288,7766,8602,9135,10065,10656,11685,12337,13470,14186,15428,16211,17567,18420,19895,20821
%N A379703 Antidiagonal sums of A343052.
%H A379703 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,-3,-3,3,1,-1).
%F A379703 a(n) = (n - 2)*(108 + 43*n + 8*n^2 + 3*(-1)^n*(4 + n))/48 for n > 1.
%F A379703 a(n) = a(n-1) + 3*a(n-2) - 3*a(n-3) - 3*a(n-4) + 3*a(n-5) + a(n-6) - a(n-7) for n > 8.
%F A379703 G.f.: x^3*(6 + 12*x- 5*x^2 - 10*x^3 + 2*x^4 + 3*x^5)/((1 - x)^4*(1 + x)^3).
%F A379703 E.g.f.: (x^3/6 + 9*x^2/8 + x - 5)*cosh(x) + (4*x^3 + 24*x^2 + 33*x - 96)*sinh(x)/24.
%F A379703 Conjecture: a(n) = A273790((n-1)/2) for n odd and > 1.
%t A379703 LinearRecurrence[{1,3,-3,-3,3,1,-1},{0,0,0,6,18,31,57,80,125},50]
%t A379703 CoefficientList[Series[x^3*(6+12*x-5*x^2-10*x^3+2*x^4+3*x^5)/((1-x)^4*(1+x)^3),{x,0,60}],x] (* _Vincenzo Librandi_, Jan 02 2025 *)
%o A379703 (Magma) [0,0] cat [(n - 2)*(108 + 43*n + 8*n^2 + 3*(-1)^n*(4 + n))/48: n in [2..60]]; // _Vincenzo Librandi_, Jan 02 2025
%Y A379703 Cf. A273790, A343052.
%K A379703 nonn,easy
%O A379703 0,4
%A A379703 _Stefano Spezia_, Dec 30 2024