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.

A279558 Number of length n inversion sequences avoiding the patterns 010, 120, and 210.

Original entry on oeis.org

1, 1, 2, 5, 15, 52, 200, 830, 3654, 16869, 80963, 401300, 2043610, 10649335, 56604706, 306101789, 1680515427
Offset: 0

Views

Author

Megan A. Martinez, Jan 17 2017

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

Examples

			The length 4 inversion sequences avoiding (010, 120, 210) are 0000, 0001, 0002, 0003, 0011, 0012, 0013, 0021, 0022, 0023, 0111, 0112, 0113, 0122, 0123.
		

Crossrefs

Extensions

a(10)-a(12) from Alois P. Heinz, Feb 24 2017
a(13)-a(16) from Bert Dobbelaere, Dec 30 2018