OFFSET
0,3
COMMENTS
A length n inversion sequence e_1e_2...e_n is a sequence of integers such that 0 <= e_i < i. The term a(n) counts the inversion sequences of length n with no entries e_i, e_{i+1}, e_{i+2} such that e_i < e_{i+1} = e_{i+2}. That is, a(n) counts the inversion sequences of length n avoiding the consecutive pattern 011.
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..448
Juan S. Auli, Pattern Avoidance in Inversion Sequences, Ph. D. thesis, Dartmouth College, ProQuest Dissertations Publishing (2020), 27964164.
Juan S. Auli and Sergi Elizalde, Consecutive Patterns in Inversion Sequences, arXiv:1904.02694 [math.CO], 2019.
Juan S. Auli and Sergi Elizalde, Consecutive patterns in inversion sequences II: avoiding patterns of relations, arXiv:1906.07365 [math.CO], 2019.
FORMULA
a(n) ~ n! * c / sqrt(n), where c = 1.3306953765239857433314976921138998977998... - Vaclav Kotesovec, Oct 19 2019
EXAMPLE
The a(4)=17 length 4 inversion sequences avoiding the consecutive pattern 011 are 0000, 0100, 0010, 0020, 0120, 0001, 0101, 0021, 0121, 0002, 0102, 0012, 0003, 0103, 0013, 0023, and 0123.
MAPLE
# after Alois P. Heinz in A328357
b := proc(n, x, t) option remember; `if`(n = 0, 1, add(
`if`(t and i < x, 0, b(n - 1, i, i = x)), i = 0 .. n - 1))
end proc:
a := n -> b(n, -1, false):
seq(a(n), n = 0 .. 24);
MATHEMATICA
b[n_, x_, t_] := b[n, x, t] = If[n == 0, 1, Sum[If[t && i < x, 0, b[n - 1, i, i == x]], {i, 0, n - 1}]];
a[n_] := b[n, -1, False];
CROSSREFS
KEYWORD
nonn
AUTHOR
Juan S. Auli, Oct 17 2019
STATUS
approved