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.

A307464 Number of Catalan words of length n avoiding the pattern 000.

This page as a plain text file.
%I A307464 #10 Aug 25 2022 10:03:04
%S A307464 1,1,2,4,9,19,42,90,197,425,926,2004,4357,9443,20510,44482,96569,
%T A307464 209505,454730,986676,2141361,4646659,10084066,21882682,47488221,
%U A307464 103052201,223634182,485302564,1053152909,2285426419,4959582582,10762708930,23356030257,50684574465
%N A307464 Number of Catalan words of length n avoiding the pattern 000.
%H A307464 J.-L. Baril, S. Kirgizov, V. Vanjovszki, <a href="http://doi.org/10.1016/j.disc.2018.06.001">Descent distribution on Catalan words avoiding a pattern of length at most three</a>, Disc. Math. 341 (2018) 2608-2615, Table 2.
%H A307464 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,-1).
%F A307464 a(n) = A125691(n)-2*A125691(n-2).
%F A307464 G.f.: (1-2*x^2)/(1-x-3*x^2+x^3).
%p A307464 (1-2*x^2)/(1-x-3*x^2+x^3) ;
%p A307464 taylor(%,x=0,30) ;
%p A307464 gfun[seriestolist](%) ;
%t A307464 LinearRecurrence[{1,3,-1},{1,1,2},40] (* _Harvey P. Dale_, Aug 06 2019 *)
%Y A307464 Cf. A000108, A125691, A356697, A356698.
%K A307464 nonn,easy
%O A307464 0,3
%A A307464 _R. J. Mathar_, Apr 09 2019