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 A011936 #16 Oct 29 2024 03:43:53 %S A011936 0,0,0,0,0,4,13,32,64,116,193,304,456,660,924,1260,1680,2196,2824, %T A011936 3577,4472,5524,6752,8173,9808,11676,13800,16200,18900,21924,25296, %U A011936 29044,33193,37772,42808,48332,54373,60964,68136,75924,84360,93480,103320,113916,125308,137533,150632,164644,179612,195577 %N A011936 a(n) = floor( n*(n-1)*(n-2)*(n-3)/26 ). %H A011936 G. C. Greubel, <a href="/A011936/b011936.txt">Table of n, a(n) for n = 0..2500</a> %H A011936 <a href="/index/Rec#order_17">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1,0,0,0,0,0,0,0,0,1,-4,6,-4,1). %F A011936 From _Chai Wah Wu_, Aug 02 2020: (Start) %F A011936 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) + a(n-13) - 4*a(n-14) + 6*a(n-15) - 4*a(n-16) + a(n-17) for n > 16. %F A011936 G.f.: x^5*(4 -3*x +4*x^2 -2*x^3 +4*x^4 -2*x^5 +4*x^6 -2*x^7 +4*x^8 -3*x^9 +4*x^10)/((1-x)^4*(1-x^13)). (End) %p A011936 A011936:=n->floor(n*(n-1)*(n-2)*(n-3)/26): seq(A011936(n), n=0..100); # _Wesley Ivan Hurt_, Feb 03 2017 %t A011936 Floor[12*Binomial[Range[0,80], 4]/13] (* _G. C. Greubel_, Oct 29 2024 *) %o A011936 (Magma) [Floor(12*Binomial(n,4)/13): n in [0..80]]; // _G. C. Greubel_, Oct 29 2024 %o A011936 (SageMath) [12*binomial(n,4)//13 for n in range(81)] # _G. C. Greubel_, Oct 29 2024 %Y A011936 Cf. A011915. %K A011936 nonn,easy %O A011936 0,6 %A A011936 _N. J. A. Sloane_ %E A011936 More terms added by _G. C. Greubel_, Oct 29 2024