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 A153008 #17 Oct 27 2021 09:27:13
%S A153008 0,0,0,1,5,21,81,302,1107,4027,14608,52988,192501,701065,2560806,
%T A153008 9384273,34504203,127288011,471102318,1749063906,6513268401,
%U A153008 24323719461,91081800417,341929853235,1286711419527,4852902998951,18341683253676
%N A153008 Catalan number A000108(n) minus Motzkin number A001006(n).
%C A153008 Number of Dyck n-paths with at least one UUU. - _David Scambler_, Sep 17 2012
%F A153008 a(n) = A000108(n) - A001006(n).
%F A153008 Conjecture: -(n+1)*(n-3)*(n+2)^2*a(n) +3*(n+1)*(2*n^3-n^2-15*n+8)*a(n-1) -(n-1)*(5*n^3-41*n+48)*a(n-2) -6*(n-1)*(n-2)*(2*n-5)*(n+3)*a(n-3)=0, n>=6 - _R. J. Mathar_, Mar 04 2018
%p A153008 A001006 := proc(n) (3/2)^(n+2)*add( 3^(-k)*A000108(k-1)*binomial(k,n+2-k), k=1..n+2) ; end:
%p A153008 A153008 := proc(n) A000108(n)-A001006(n) ;
%p A153008 end:
%p A153008 seq(A153008(n),n=0..30) ; # _R. J. Mathar_, Jan 22 2009
%t A153008 MotzkinNumber = DifferenceRoot[Function[{y, n}, {(-3n-3)*y[n] + (-2n-5)*y[n+1] + (n+4)*y[n+2] == 0, y[0] == 1, y[1] == 1}]];
%t A153008 a[n_] := CatalanNumber[n] - MotzkinNumber[n];
%t A153008 Table[a[n], {n, 0, 26}] (* _Jean-François Alcover_, Oct 27 2021 *)
%Y A153008 Cf. A000108, A001006.
%K A153008 easy,nonn
%O A153008 0,5
%A A153008 _Omar E. Pol_, Dec 20 2008