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 A034264 #16 Jul 11 2025 12:11:40
%S A034264 0,1,11,56,196,546,1302,2772,5412,9867,17017,28028,44408,68068,101388,
%T A034264 147288,209304,291669,399399,538384,715484,938630,1216930,1560780,
%U A034264 1981980,2493855,3111381,3851316,4732336,5775176,7002776,8440432
%N A034264 a(n) = f(n,4) where f is given in A034261.
%H A034264 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).
%F A034264 G.f.: -x*(1+4*x)/(x-1)^7. - _R. J. Mathar_, Feb 10 2025
%F A034264 a(n) = n*(5*n+1)*(n+4)*(n+3)*(n+2)*(n+1)/720. - _R. J. Mathar_, Feb 10 2025
%p A034264 A034261 := proc(n, k) binomial(n+k, k+1)*(n*k+n+1)/(k+2); end;
%p A034264 seq( A034261(n,4),n=0..40) ;
%t A034264 LinearRecurrence[{7,-21,35,-35,21,-7,1},{0,1,11,56,196,546,1302},40] (* _Harvey P. Dale_, Jul 11 2025 *)
%Y A034264 Cf. A034261.
%K A034264 nonn,easy
%O A034264 0,3
%A A034264 _Clark Kimberling_
%E A034264 Corrected and extended by _N. J. A. Sloane_, Apr 21 2000