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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005753 Number of rooted identity matched trees with n nodes.
(Formerly M1514)
3
1, 2, 5, 18, 66, 266, 1111, 4792, 21124, 94888, 432415, 1994828, 9296712, 43706722, 207030398, 987130456, 4733961435, 22819241034, 110500644857, 537295738556, 2622248720234, 12840953621208, 63074566121245 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

R. Simion, Trees with 1-factors and oriented trees, Discrete Math., 88 (1991), 93-104.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 429

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

G.f.: x*Product_{n>=1} (1 + x^n)^(2*a(n)) = Sum_{n>=1} a(n)*x^n. [From Paul D. Hanna, Dec 31 2011]

EXAMPLE

G.f.: A(x) = x + 2*x^2 + 5*x^3 + 18*x^4 + 66*x^5 + 266*x^6 +...

where A(x) = x*(1+x)^2*(1+x^2)^4*(1+x^3)^10*(1+x^4)^36*(1+x^5)^132*...

PROG

(PARI) {a(n)=polcoeff(x*prod(k=1, n-1, (1+x^k+x*O(x^n))^(2*a(k))), n)} /* Paul D. Hanna */

CROSSREFS

Cf. A038077.

Sequence in context: A150017 A150018 A150019 * A150020 A144721 A150021

Adjacent sequences:  A005750 A005751 A005752 * A005754 A005755 A005756

KEYWORD

nonn,eigen

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Also rooted identity trees with n nodes and 2-colored non-root nodes.

Extended with alternative description by Christian G. Bower (bowerc(AT)usa.net), Apr 15 1998.

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 17 13:28 EST 2012. Contains 206031 sequences.