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 A229146 #9 Apr 29 2022 18:35:30
%S A229146 0,4,52,243,736,1750,3564,6517,11008,17496,26500,38599,54432,74698,
%T A229146 100156,131625,169984,216172,271188,336091,412000,500094,601612,
%U A229146 717853,850176,1000000,1168804,1358127,1569568,1804786,2065500,2353489,2670592,3018708,3399796
%N A229146 a(n) = n^3*(5*n+3)/2.
%C A229146 Number of ascending runs in {1,...,n}^4.
%H A229146 Alois P. Heinz, <a href="/A229146/b229146.txt">Table of n, a(n) for n = 0..1000</a>
%H A229146 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5, -10, 10, -5, 1).
%F A229146 G.f.: -(x^3+23*x^2+32*x+4)*x/(x-1)^5.
%p A229146 a:= n-> n^3*(5*n+3)/2:
%p A229146 seq(a(n), n=0..40);
%t A229146 Table[n^3(5n+3)/2,{n,0,40}] (* or *) LinearRecurrence[{5,-10,10,-5,1},{0,4,52,243,736},40] (* _Harvey P. Dale_, Apr 29 2022 *)
%Y A229146 Row n=4 of A229079.
%K A229146 nonn,easy
%O A229146 0,2
%A A229146 _Alois P. Heinz_, Sep 15 2013