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 A325517 #23 Sep 08 2022 08:46:24 %S A325517 0,1,6,24,64,145,282,504,832,1305,1950,2816,3936,5369,7154,9360,12032, %T A325517 15249,19062,23560,28800,34881,41866,49864,58944,69225,80782,93744, %U A325517 108192,124265,142050,161696,183296,207009,232934,261240,292032,325489,361722,400920,443200 %N A325517 a(n) = n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24. %C A325517 For n > 0, a(n) is the n-th row sum of the triangle A325516. %H A325517 Stefano Spezia, <a href="/A325517/b325517.txt">Table of n, a(n) for n = 0..10000</a> %H A325517 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (3,-1,-5,5,1,-3,1). %F A325517 O.g.f.: x*(1 + 3*x + 7*x^2 + 3*x^3 + 2*x^4)/((1 - x)^5*(1 + x)^2). %F A325517 E.g.f.: (1/24)*exp(-x)*x*(3 + 21*exp(2*x) + 54*exp(2*x)*x + 30*exp(2*x)*x^2 + 4*exp(2*x)*x^3). %F A325517 a(n) = 3*a(n-1) - a(n-2) - 5*a(n-3) + 5*a(n-4) + a(n-5) - 3*a(n-6) + a(n-7) for n > 6. %F A325517 a(n) = n^2*(2*n^2 + 3*n + 4)/12 if n is even. %F A325517 a(n) = n*(n + 1)*(2*n^2 + n + 3)/12 if n is odd. %F A325517 a(n) = n*A131941(n). - _Stefano Spezia_, Dec 21 2021 %p A325517 a:=n->n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24: seq(a(n), n=0..50); %t A325517 a[n_]:=n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24; Array[a,50,0] %o A325517 (GAP) Flat(List([0..50], n->n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24)); %o A325517 (Magma) [n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24: n in [0..50]]; %o A325517 (PARI) a(n) = n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24; %Y A325517 Cf. A131941, A317614, A322277, A325516. %K A325517 nonn,easy %O A325517 0,3 %A A325517 _Stefano Spezia_, May 07 2019