login
A279570
Number of length n inversion sequences avoiding the patterns 110 and 120.
29
1, 1, 2, 6, 22, 92, 423, 2091, 10950, 60120, 343453, 2029809, 12354661, 77168197, 493189283, 3217459119, 21382723456, 144518555231, 991885282987, 6904454991721, 48691257834999, 347542736059492, 2508603139285095, 18297609829743478, 134772911886028731
OFFSET
0,3
COMMENTS
A length n inversion sequence e_1e_2...e_n is a sequence of integers where 0 <= e_i <= i-1. The term a(n) counts those length n inversion sequences with no entries e_i, e_j, e_k (where i<j<k) such that e_i <= e_j > e_k and e_i > e_k. This is the same as the set of length n inversion sequences avoiding 110 and 120.
LINKS
Megan A. Martinez and Carla D. Savage, Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations, arXiv:1609.08106 [math.CO], 2016.
EXAMPLE
The length 4 inversion sequences avoiding (110,120) are 0000, 0001, 0002, 0003, 0010, 0011, 0012, 0013, 0020, 0021, 0022, 0023, 0100, 0101, 0102, 0103, 0111, 0112, 0113, 0121, 0122, 0123.
KEYWORD
nonn
AUTHOR
Megan A. Martinez, Feb 21 2017
EXTENSIONS
a(10)-a(24) from Alois P. Heinz, Feb 21 2017
STATUS
approved