login
A279562
Number of length n inversion sequences avoiding the patterns 100, 102, and 201.
22
1, 1, 2, 6, 21, 78, 299, 1176, 4729, 19378, 80667, 340260, 1451277, 6248758, 27124703, 118576648, 521574769, 2306766426
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 100, 102, and 201.
LINKS
Megan A. Martinez, Carla D. Savage, Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations, arXiv:1609.08106 [math.CO], 2016-2018.
EXAMPLE
The length 4 inversion sequences avoiding (100, 102, 201) are 0000, 0001, 0002, 0003, 0010, 0011, 0012, 0013, 0020, 0021, 0022, 0023, 0101, 0110, 0111, 0112, 0113, 0120, 0121, 0122, 0123.
KEYWORD
nonn,more
AUTHOR
Megan A. Martinez, Feb 09 2017
EXTENSIONS
a(10)-a(12) from Alois P. Heinz, Feb 24 2017
a(13)-a(17) from Bert Dobbelaere, Dec 30 2018
STATUS
approved