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”).

A369476
Total number of weak ascents in all length-n weak ascent sequences.
1
0, 1, 4, 17, 83, 461, 2873, 19846, 150418, 1240398, 11051017, 105740309, 1081101474, 11758967146, 135544030566, 1650178088102, 21155166649234, 284821038726404, 4017445572746953, 59238368957321225, 911319667593472401, 14600491369553323529, 243205500769215401307
OFFSET
0,3
COMMENTS
See A369321 for definitions.
LINKS
FORMULA
a(n) = Sum_{k=0..n} k * A369321(n,k).
a(n) = A336070(n+1) - A336070(n).
MAPLE
b:= proc(n, i, t) option remember; `if`(n=0, 1,
add(b(n-1, j, t+`if`(j>=i, 1, 0)), j=0..t+1))
end:
a:= n-> b(n+1, -1$2)-b(n, -1$2):
seq(a(n), n=0..23);
CROSSREFS
Sequence in context: A377960 A373931 A052315 * A200716 A093904 A093344
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jan 23 2024
STATUS
approved