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 A229281 #11 Jul 01 2023 16:00:21
%S A229281 0,7,77,735,6517,55223,453789,3647119,28824005,224827239,1735205101,
%T A229281 13276336703,100843663893,761270796055,5716451614013,42728053589487,
%U A229281 318086621166181,2359538070441671,17447288549040525,128644674234925471,946108300385970869
%N A229281 Number of ascending runs in {1,...,7}^n.
%H A229281 Alois P. Heinz, <a href="/A229281/b229281.txt">Table of n, a(n) for n = 0..1000</a>
%H A229281 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (14,-49).
%F A229281 G.f.: -7*(3*x-1)*x/(7*x-1)^2.
%F A229281 a(n) = 7^(n-1)*(4*n+3) for n>0, a(0) = 0.
%p A229281 a:= n-> `if`(n=0, 0, 7^(n-1)*(4*n+3)):
%p A229281 seq(a(n), n=0..30);
%Y A229281 Column k=7 of A229079.
%K A229281 nonn,easy
%O A229281 0,2
%A A229281 _Alois P. Heinz_, Sep 18 2013