login
A279552
Number of length n inversion sequences avoiding the patterns 000 and 010.
24
1, 1, 2, 4, 10, 29, 95, 345, 1376, 5966, 27886, 139608, 744552, 4210191, 25140790, 157981820, 1041480482, 7183374125, 51711299169, 387683162541, 3020997261596, 24424884853963, 204559337781097, 1772011400733378, 15855597322378302, 146360032952969570
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_j >= e_k and e_i = e_k. This is the same as the set of length n inversion sequences avoiding 000 and 010.
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.
Benjamin Testart, Inversion sequences avoiding the pattern 010, arXiv:2212.07222 [math.CO], 2022.
EXAMPLE
For n=3, the inversion sequences are 001, 002, 011, 012.
For n=4, the inversion sequences are 0011, 0012, 0013, 0021, 0022, 0023, 0112, 0113, 0122, 0123.
KEYWORD
nonn
AUTHOR
Megan A. Martinez, Dec 15 2016
EXTENSIONS
a(10)-a(20) from Alois P. Heinz, Feb 23 2017
a(21) onwards from Benjamin Testart, Feb 01 2023
STATUS
approved