login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139263 Number of two element anti-chains in Riordan trees on n edges (also called non-redundant trees, i.e., ordered trees where no vertex has out-degree equal to 1). 1
0, 0, 1, 3, 14, 48, 172, 580, 1941, 6373, 6373 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..10.

FORMULA

G.f.: A=x^2(xM+1)^3((xR)')^3(1/R) where M is the generating function for the Motzkin numbers and R is the generating function for the Riordan numbers.

CROSSREFS

Cf. A139262.

Sequence in context: A212505 A024453 A176027 * A261043 A063025 A187917

Adjacent sequences:  A139260 A139261 A139262 * A139264 A139265 A139266

KEYWORD

nonn

AUTHOR

Lifoma Salaam, Apr 12 2008

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 13:52 EST 2018. Contains 318063 sequences. (Running on oeis4.)