cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A279556 Number of length n inversion sequences avoiding the patterns 010, 110, and 120.

Original entry on oeis.org

1, 1, 2, 5, 15, 51, 190, 759, 3206, 14180, 65203, 309998, 1517330, 7619541, 39145113, 205261890, 1096393056, 5955598301, 32852080738, 183797522935, 1041802426740, 5977047039743, 34679912608313, 203345277644481, 1204104271508239, 7196256426157901
Offset: 0

Views

Author

Megan A. Martinez, Dec 16 2016

Keywords

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 e_k and e_i >= e_k. This is the same as the set of length n inversion sequences avoiding 010, 110, and 120.

Examples

			The length 3 inversion sequences avoiding (010, 110, 120) are 000, 001, 002, 011, 012
The length 4 inversion sequences avoiding (010, 110, 120) are 0000, 0001, 0002, 0003, 0011, 0012, 0013, 0021, 0022, 0023, 0111, 0112, 0113, 0122, 0123.
		

Crossrefs

Extensions

a(10)-a(11) from Alois P. Heinz, Feb 24 2017
a(12)-a(16) from Bert Dobbelaere, Dec 30 2018
a(17)-a(25) from Nicholas R. Beaton, Aug 29 2025