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.
%I A360052 #13 Jul 12 2024 09:51:47 %S A360052 1,1,2,5,15,53,214,958,4650,24103,131974,757011,4519321,27933252, %T A360052 177987808,1165057411,7811122974,53506838952,373693431140, %U A360052 2656088059747,19182588092365,140577110057850,1044102585724522,7851149068600037,59714190403840142,459001044591439621 %N A360052 Number of length n inversion sequences avoiding the patterns 010 and 201 (or 010 and 210). %H A360052 Benjamin Testart, <a href="/A360052/b360052.txt">Table of n, a(n) for n = 0..200</a> %H A360052 Benjamin Testart, <a href="https://arxiv.org/abs/2212.07222">Inversion sequences avoiding the pattern 010</a>, arXiv:2212.07222 [math.CO], 2022. See Table 2 p. 2. %H A360052 Benjamin Testart, <a href="https://arxiv.org/abs/2407.07701">Completing the enumeration of inversion sequences avoiding one or two patterns of length 3</a>, arXiv:2407.07701 [math.CO], 2024. %H A360052 Chunyan Yan and Zhicong Lin, <a href="https://arxiv.org/abs/1912.03674">Inversion sequences avoiding pairs of patterns</a>, arXiv:1912.03674 [math.CO], 2019. %Y A360052 Cf. A263779, A263777. %K A360052 nonn %O A360052 0,3 %A A360052 _Benjamin Testart_, Jan 23 2023