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 A229149 #12 Oct 22 2023 12:22:36
%S A229149 0,7,704,10935,77824,359375,1259712,3647119,9175040,20726199,43000000,
%T A229149 83263367,152285184,265474495,444242624,717609375,1124073472,
%U A229149 1713767399,2550916800,3716624599,5312000000,7461652527,10317571264,14063409455,18919194624,25146484375
%N A229149 a(n) = n^6*(4*n+3).
%C A229149 Number of ascending runs in {1,...,n}^7.
%H A229149 Alois P. Heinz, <a href="/A229149/b229149.txt">Table of n, a(n) for n = 0..1000</a>
%H A229149 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (8,-28,56,-70,56,-28,8,-1).
%F A229149 G.f.: (x^6+312*x^5+4029*x^4+9664*x^3+5499*x^2+648*x+7)*x/(x-1)^8.
%p A229149 a:= n-> n^6*(4*n+3):
%p A229149 seq(a(n), n=0..40);
%t A229149 Table[n^6 (4n+3),{n,0,40}] (* _Harvey P. Dale_, Oct 10 2023 *)
%Y A229149 Row n=7 of A229079.
%K A229149 nonn,easy
%O A229149 0,2
%A A229149 _Alois P. Heinz_, Sep 15 2013