A264915 Number of 10-ascent sequences of length n with no consecutive repeated letters.

1, 1, 10, 110, 1265, 15235, 191785, 2519605, 34494625, 491432590, 7276062838, 111816814439, 1781492191281, 29392907305322, 501677394880530, 8849027884862077, 161155012811798819, 3027460412190175918, 58617635130507630386, 1168800382939975874066

Offset

0,3

Links

Alois P. Heinz, Table of n, a(n) for n = 0..200

S. Kitaev, J. Remmel, p-Ascent Sequences, arXiv:1503.00914 [math.CO], 2015.

Maple

b:= proc(n, i, t) option remember; `if`(n<1, 1, add(
      `if`(j=i, 0, b(n-1, j, t+`if`(j>i, 1, 0))), j=0..t+10))
    end:
a:= n-> (b(n-1, 0$2)):
seq(a(n), n=0..30);

Mathematica

b[n_, i_, t_] := b[n, i, t] = If[n < 1, 1, Sum[If[j == i, 0, b[n - 1, j, t + If[j > i, 1, 0]]], {j, 0, t + 10}]]; a[n_] :=  b[n - 1, 0, 0];
Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Nov 09 2017, after Alois P. Heinz *)

Crossrefs

Column k=10 of A264909.

Sequence in context: A343331 A057093 A055276 * A289414 A143749 A276507

Adjacent sequences: A264912 A264913 A264914 * A264916 A264917 A264918

Keyword

nonn

Author

Alois P. Heinz, Nov 28 2015

Status

approved