|
|
A264915
|
|
Number of 10-ascent sequences of length n with no consecutive repeated letters.
|
|
2
|
|
|
1, 1, 10, 110, 1265, 15235, 191785, 2519605, 34494625, 491432590, 7276062838, 111816814439, 1781492191281, 29392907305322, 501677394880530, 8849027884862077, 161155012811798819, 3027460412190175918, 58617635130507630386, 1168800382939975874066
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
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];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|