Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119856
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119856 Number of equicolorable (unrooted) trees on 2n nodes. +0
1
1, 1, 3, 9, 37, 168, 895 (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: A149022 A134818 A002751 this_sequence A077365 A006229 A008986

Adjacent sequences: A119853 A119854 A119855 this_sequence A119857 A119858 A119859

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research