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 A229280 #11 Jul 01 2023 15:59:57
%S A229280 0,6,57,468,3564,25920,182736,1259712,8538048,57106944,377913600,
%T A229280 2479113216,16144468992,104485552128,672625741824,4310029025280,
%U A229280 27505821597696,174908814262272,1108696193630208,7007637010120704,44178581150760960,277868041444786176
%N A229280 Number of ascending runs in {1,...,6}^n.
%H A229280 Alois P. Heinz, <a href="/A229280/b229280.txt">Table of n, a(n) for n = 0..1000</a>
%H A229280 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-36).
%F A229280 G.f.: -3*(5*x-2)*x/(6*x-1)^2.
%F A229280 a(n) = 6^(n-1)*(7*n+5)/2 for n>0, a(0) = 0.
%p A229280 a:= n-> `if`(n=0, 0, 6^(n-1)*(7*n+5)/2):
%p A229280 seq(a(n), n=0..30);
%Y A229280 Column k=6 of A229079.
%K A229280 nonn,easy
%O A229280 0,2
%A A229280 _Alois P. Heinz_, Sep 18 2013