cp's OEIS Frontend

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.

A302302 Number of triples (i,j,k) such that i+j+k > 0 with -n <= i,j,k <= n.

This page as a plain text file.
%I A302302 #25 Oct 19 2022 08:10:23
%S A302302 0,10,53,153,334,620,1035,1603,2348,3294,4465,5885,7578,9568,11879,
%T A302302 14535,17560,20978,24813,29089,33830,39060,44803,51083,57924,65350,
%U A302302 73385,82053,91378,101384,112095,123535,135728,148698,162469,177065,192510,208828,226043
%N A302302 Number of triples (i,j,k) such that i+j+k > 0 with -n <= i,j,k <= n.
%C A302302 If we add the triples (i,j,k) such that i+j+k >= 0 then the corresponding numbers seem to be those of A130748.
%H A302302 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1)
%F A302302 From _Alois P. Heinz_, Apr 08 2018: (Start)
%F A302302 a(n) = n*(3+9*n+8*n^2)/2.
%F A302302 G.f.: (x^2+13*x+10)*x/(x-1)^4.
%F A302302 a(n) = A130748(n) - A003215(n) for n > 0. (End)
%t A302302 a[n_]:=Total[Flatten[Table[Table[Table[If[i+j+k>0,1,0],{i,-n,n}],{j,-n,n}],{k,-n,n}]]];
%t A302302 Table[a[n],{n,0,32}]
%o A302302 (PARI) a(n) = n*(3+9*n+8*n^2)/2; \\ _Altug Alkan_, Apr 08 2018
%Y A302302 Cf. A003215, A130748.
%K A302302 nonn,easy
%O A302302 0,2
%A A302302 _Andres Cicuttin_, Apr 05 2018