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 A117652 #21 Nov 02 2024 19:49:33
%S A117652 0,-1,-1,-2,-2,-2,0,3,10,20,35,55,84,120,168,227,300,388,495,621,770,
%T A117652 943,1144,1374,1638,1937,2275,2654,3080,3553,4080,4662,5304,6009,6783,
%U A117652 7628,8550,9552,10640,11817,13090,14462,15939,17525,19228,21050,23000,25081
%N A117652 a(n) = floor(n*(n+2)*(n+4)*(n-6)/192).
%C A117652 Quasipolynomial with period 16. - _Charles R Greathouse IV_, Sep 06 2011
%H A117652 Vincenzo Librandi, <a href="/A117652/b117652.txt">Table of n, a(n) for n = 0..10000</a>
%H A117652 <a href="/index/Rec#order_18">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,0,4,0,-4,0,4,0,-4,0,4,0,-4,0,5,-4,1).
%F A117652 a(n) = floor( n*(n+2)*(n+4)*(n-6)/192).
%F A117652 a(n) = 4*a(n-1) - 5*a(n-2) + 4*a(n-4) - 4*a(n-6) + 4*a(n-8) - 4*a(n-10) + 4*a(n-12) - 4*a(n-14) + 5*a(n-16) - 4*a(n-17) + a(n-18).
%t A117652 Table[Floor[n*(n+1)*(n+2)*(n-3)/12], {n, 0, 25, 1/2}]
%t A117652 LinearRecurrence[{4,-5,0,4,0,-4,0,4,0,-4,0,4,0,-4,0,5,-4,1},{0,-1,-1,-2,-2,-2,0,3,10,20,35,55,84,120,168,227,300,388},50] (* _Harvey P. Dale_, Nov 02 2024 *)
%o A117652 (Magma) [Floor( n*(n+2)*(n+4)*(n-6)/192): n in [0..50]]; // _Vincenzo Librandi_, Sep 06 2011
%o A117652 (PARI) a(n)=n*(n+2)*(n+4)*(n-6)\192 \\ _Charles R Greathouse IV_, Sep 06 2011
%o A117652 (Sage) [floor(n*(n+2)*(n+4)*(n-6)/192) for n in (0..50)] # _G. C. Greubel_, May 20 2019
%Y A117652 Cf. A052472, A018226.
%K A117652 sign,easy
%O A117652 0,4
%A A117652 _Roger L. Bagula_, Apr 11 2006
%E A117652 More precise description, converted to a more regular signed sequence - the Assoc. Eds. of the OEIS, Jun 27 2010