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 A202060 #17 Jan 19 2024 21:11:52 %S A202060 1,1,2,5,14,43,143,510,1936,7774,32848,145398,671641,3227218,16084747, %T A202060 82955090,441773793,2424845273,13695855478,79485625385,473393639992, %U A202060 2889930405750,18064609329598,115513453404597,754956282308784,5039064184597772,34323984497482559 %N A202060 Number of ascent sequences avoiding the pattern 110. %C A202060 It appears that no formula or g.f. is known. %H A202060 Andrew Conway and Miles Conway, <a href="/A202060/b202060.txt">Table of n, a(n) for n = 0..43</a> %H A202060 Andrew R. Conway, Miles Conway, Andrew Elvey Price and Anthony J. Guttmann, <a href="https://arxiv.org/abs/2111.01279">Pattern-avoiding ascent sequences of length 3</a>, arXiv:2111.01279 [math.CO], Nov 01 2021. %H A202060 P. Duncan and Einar Steingrimsson, <a href="http://arxiv.org/abs/1109.3641">Pattern avoidance in ascent sequences</a>, arXiv preprint arXiv:1109.3641, 2011 %Y A202060 Total number of ascent sequences is given by A022493. Number of ascent sequences avoiding 001 (and others) is A000079; 102 is A007051; 101 is A000108; 000 is A202058; 100 is A202059; 110 is A202060; 120 is A202061; 201 is A202062; 210 is A108304; 0123 is A080937; 0021 is A007317. %K A202060 nonn %O A202060 0,3 %A A202060 _N. J. A. Sloane_, Dec 10 2011 %E A202060 a(0) and a(15)-a(17) from _Alois P. Heinz_, Jan 07 2014 %E A202060 More terms from _Anthony Guttmann_, Nov 04 2021