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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119855 Number of equicolorable rooted trees on 2n nodes. 0
1, 2, 9, 44, 249, 1506, 9687 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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: A026302 A124889 A108308 * A047119 A052881 A020071

Adjacent sequences:  A119852 A119853 A119854 * A119856 A119857 A119858

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Aug 04 2006

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 14:50 EST 2012. Contains 206050 sequences.