[seqfan] Re: A02253 and prime Dyck paths

[Allan Wechsler]

Wouldn't the number of *prime* Dyck words of length 2n be exactly the
number of *all *Dyck words of length 2(n-1)? The two sets seem to be in 1-1
correspondents by the operation of removing/restoring the first and last
letters.

On Thu, Sep 23, 2021 at 7:43 AM Richard J. Mathar <mathar at mpia-hd.mpg.de>
wrote:

> Are the "prime" Dyck Paths (Dyck Paths returning to the horizontal only
> once, at the end)
> mentioned by David Callan's comment in A037952 counted by A022553?
> See also A289978 for an attempt to count Dyck paths by the number of their
> components.
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>