Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005753
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005753 Number of rooted identity matched trees with n nodes.
(Formerly M1514)
+0
4
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; listen)
OFFSET

1,2

REFERENCES

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

LINKS

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 429

FORMULA

a(n+1) has g.f.: prod from n =1 to inf ( 1 + x^ 2 a ( n ) ).

CROSSREFS

Cf. A038077.

Adjacent sequences: A005750 A005751 A005752 this_sequence A005754 A005755 A005756

Sequence in context: A093635 A024025 A084518 this_sequence A118814 A014271 A073157

KEYWORD

nonn,eigen

AUTHOR

njas

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.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research