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 A356697 #9 Aug 25 2022 08:49:11 %S A356697 1,1,2,5,13,36,101,280,788,2212,6186,17384,48755,136649,383584, %T A356697 1075734,3016924,8464693,23740844,66592246,186807727,523973400, %U A356697 1469769653,4122833303,11564436141,32438795011,90992182917,255234015580,715941436278,2008237780651 %N A356697 Number of Catalan words of length n avoiding the pattern 0000. %H A356697 Alois P. Heinz, <a href="/A356697/b356697.txt">Table of n, a(n) for n = 0..1000</a> %H A356697 Jean-Luc Baril, Sergey Kirgizov and Vincent Vajnovszki, <a href="https://arxiv.org/abs/1803.06706">Descent distribution on Catalan words avoiding a pattern of length at most three</a>, arXiv:1803.06706 [math.CO], 2018. %H A356697 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,9,-7,-6,1) %F A356697 G.f.: -(3*x^5-9*x^3-2*x^2+1)/((x-1)*(x^5-5*x^4-12*x^3-3*x^2+1)). %Y A356697 Cf. A000108, A307464, A356698. %K A356697 nonn,easy %O A356697 0,3 %A A356697 _Alois P. Heinz_, Aug 23 2022