Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119855
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119855 Number of equicolorable rooted trees on 2n nodes. +0
1
1, 2, 9, 44, 249, 1506, 9687 (list; graph; listen)
OFFSET

1,2

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

Adjacent sequences: A119852 A119853 A119854 this_sequence A119856 A119857 A119858

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), 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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research