login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247333 Number of Dyck paths of semilength n avoiding the consecutive step pattern UDUDU, where U=(1,1) and D=(1,-1). 3
1, 1, 2, 4, 11, 31, 92, 283, 893, 2875, 9407, 31189, 104555, 353794, 1206821, 4145350, 14326184, 49778473, 173794610, 609392578, 2145057797, 7577098816, 26850456704, 95425761829, 340047930692, 1214738997142, 4349231444405, 15604726428805, 56098211626478 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Jean-Luc Baril and José Luis Ramírez, Descent distribution on Catalan words avoiding ordered pairs of Relations, arXiv:2302.12741 [math.CO], 2023.
Paul Barry, On Motzkin-Schröder Paths, Riordan Arrays, and Somos-4 Sequences, J. Int. Seq. (2023) Vol. 26, Art. 23.4.7.
Beáta Bényi, Toufik Mansour, and José L. Ramírez, Set partitions and non-crossing partitions with l-neighbors and l-isolated elements, Australasian J. Comb. (2022) Vol. 84, No. 2, 325-340.
FORMULA
Recursion: see Maple program.
a(n) ~ sqrt(42-6*sqrt(21)) * ((3+sqrt(21))/2)^n / (4 * sqrt(Pi) * n^(3/2)). - Vaclav Kotesovec, Sep 16 2014
From Vladimir Kruchinin, Mar 03 2016: (Start)
G.f.: (1+x+x^2-sqrt(-3*x^4-6*x^3-5*x^2-2*x+1))/(2*x^2+2*x).
G.f.: B(x)+1, where B(x) satisfies B(x)=(x+x^2)*(1+B(x)+B(x)^2).
a(n) = Sum_{k=1..n} binomial(k,n-k)*M(k+1), a(0)=1, where M(k) are Motzkin numbers (A001006). (End)
MAPLE
a:= proc(n) option remember; `if`(n<5, [1$2, 2, 4, 11][n+1],
((n-2)*a(n-1) +(7*n-11)*a(n-2) +(11*n-31)*a(n-3)
+(9*n-36)*a(n-4) +(3*n-15)*a(n-5)) / (n+1))
end:
seq(a(n), n=0..40);
MATHEMATICA
CoefficientList[Series[(1 + x + x^2 - Sqrt[-3 x^4 - 6 x^3 - 5 x^2 - 2 x + 1])/(2 x^2 + 2 x), {x, 0, 28}], x] (* or *)
{1}~Join~Table[Sum[(Binomial[k, n - k] Sum[Binomial[j, -k + 2 j - 1] Binomial[k, j], {j, 0, k}])/k, {k, 1, n}], {n, 1, 28}] (* Michael De Vlieger, Mar 03 2016, the latter after Maxima by Vladimir Kruchinin *)
PROG
(Maxima)
a(n):=if n=0 then 1 else sum((binomial(k, n-k)*sum(binomial(j, -k+2*j-1)*binomial(k, j), j, 0, k))/k, k, 1, n); /* Vladimir Kruchinin, Mar 03 2016 */
CROSSREFS
Cf. A001006.
Column k=0 of A246188.
Column k=21 of A243753.
Sequence in context: A148163 A274775 A039300 * A118974 A119020 A073191
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Sep 13 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 03:13 EST 2024. Contains 370219 sequences. (Running on oeis4.)