login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A229283
Number of ascending runs in {1,...,9}^n.
2
0, 9, 126, 1539, 17496, 190269, 2007666, 20726199, 210450636, 2109289329, 20920706406, 205720279659, 2008387814976, 19487638017189, 188098071296346, 1807266603941919, 17294855095950516, 164918796807813849, 1567655079768657486, 14859368894402912979
OFFSET
0,2
FORMULA
G.f.: -9*(4*x-1)*x/(9*x-1)^2.
a(n) = 9^(n-1)*(5*n+4) for n>0, a(0) = 0.
a(n) = 18*a(n-1) - 81*a(n-2). - Wesley Ivan Hurt, May 24 2024
MAPLE
a:= n-> `if`(n=0, 0, 9^(n-1)*(5*n+4)):
seq(a(n), n=0..30);
CROSSREFS
Column k=9 of A229079.
Sequence in context: A092343 A261176 A261743 * A144073 A261801 A065086
KEYWORD
nonn,easy
AUTHOR
Alois P. Heinz, Sep 18 2013
STATUS
approved