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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131638 Increasing binary trees having exactly two vertices with outdegree 1. 0
1, 11, 180, 4288 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

M. P. Develin and S. P. Sullivant, Markov Bases of Binary Graph Models, Annals of Combinatorics 7 (2003) 441-466.

C. Poupard, Deux proprietes des arbres binaires ordonnes stricts, European J. Combin., 10 (1989), 369-374.

FORMULA

E.G.F. =$frac 12(3(\sec frac x{\sqrt{2}})^2(tan frac x{\sqrt{2}})^2-frac x{\sqrt{2}}\ (\sec frac x{\sqrt{2}})^2(tan frac x{\sqrt{2}}))\ $

CROSSREFS

Sequence in context: A101791 A140034 A162715 * A157382 A174979 A157945

Adjacent sequences:  A131635 A131636 A131637 * A131639 A131640 A131641

KEYWORD

nonn

AUTHOR

Wenjin W. (wjwoan(AT)hotmail.com), Oct 03 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:21 EST 2012. Contains 205785 sequences.