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 A229152 #14 Oct 23 2023 11:15:22
%S A229152 0,10,7936,413343,6946816,62500000,377913600,1735205101,6509559808,
%T A229152 20920706406,59500000000,153266599915,363764514816,805941952348,
%U A229152 1683875312896,3344572265625,6356551598080,11621611896706,20530186553088,35172959057911,58624000000000
%N A229152 a(n) = n^9*(11*n+9)/2.
%C A229152 Number of ascending runs in {1,...,n}^10.
%H A229152 Alois P. Heinz, <a href="/A229152/b229152.txt">Table of n, a(n) for n = 0..1000</a>
%H A229152 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).
%F A229152 G.f.: -(x^9 +3317*x^8 +199643*x^7 +2172239*x^6 +6901145*x^5 +7512749*x^4 +2834873*x^3 +326597*x^2 +7826*x +10)*x / (x-1)^11.
%p A229152 a:= n-> n^9*(11*n+9)/2:
%p A229152 seq(a(n), n=0..40);
%t A229152 A229152[n_]:=n^9(11n+9)/2;Array[A229152,30,0] (* _Paolo Xausa_, Oct 23 2023 *)
%Y A229152 Row n=10 of A229079.
%K A229152 nonn,easy
%O A229152 0,2
%A A229152 _Alois P. Heinz_, Sep 15 2013