Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119857
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119857 Number of equicolored (unrooted) trees on 2n nodes. +0
1
1, 1, 4, 14, 65, 316, 1742 (list; graph; listen)
OFFSET

1,3

COMMENT

For precise definition, recurrence and asymptotics see the Pippenger reference.

REFERENCES

N. Pippenger, Enumeration of equicolorable trees, SIAM J. Discrete Math., 14 (2001), 93-115.

CROSSREFS

Sequence in context: A132079 A020041 A081891 this_sequence A126787 A129219 A007025

Adjacent sequences: A119854 A119855 A119856 this_sequence A119858 A119859 A119860

KEYWORD

nonn

AUTHOR

njas, Aug 04 2006

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research