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 A229283 #12 May 24 2024 15:53:28
%S A229283 0,9,126,1539,17496,190269,2007666,20726199,210450636,2109289329,
%T A229283 20920706406,205720279659,2008387814976,19487638017189,
%U A229283 188098071296346,1807266603941919,17294855095950516,164918796807813849,1567655079768657486,14859368894402912979
%N A229283 Number of ascending runs in {1,...,9}^n.
%H A229283 Alois P. Heinz, <a href="/A229283/b229283.txt">Table of n, a(n) for n = 0..1000</a>
%H A229283 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (18,-81).
%F A229283 G.f.: -9*(4*x-1)*x/(9*x-1)^2.
%F A229283 a(n) = 9^(n-1)*(5*n+4) for n>0, a(0) = 0.
%F A229283 a(n) = 18*a(n-1) - 81*a(n-2). - _Wesley Ivan Hurt_, May 24 2024
%p A229283 a:= n-> `if`(n=0, 0, 9^(n-1)*(5*n+4)):
%p A229283 seq(a(n), n=0..30);
%Y A229283 Column k=9 of A229079.
%K A229283 nonn,easy
%O A229283 0,2
%A A229283 _Alois P. Heinz_, Sep 18 2013