Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032068
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032068 Number of series-reduced dyslexic planted planar trees with n leaves of 2 colors where any 2 subtrees extending from the same node are different. +0
1
2, 1, 2, 7, 22, 85, 344, 1408, 5914, 25394, 110818, 488688, 2178594, 9797950, 44406134, 202591861, 929716110, 4288808485, 19876422076, 92501558277, 432109230664, 2025444499805, 9523528005822, 44906724639089 (list; graph; listen)
OFFSET

1,1
LINKS

Index entries for sequences related to rooted trees

FORMULA

Doubles (index 2+) under "BGK" (reversible, element, unlabeled) transform.

CROSSREFS

Sequence in context: A144803 A095062 A114346 this_sequence A103410 A114303 A030651

Adjacent sequences: A032065 A032066 A032067 this_sequence A032069 A032070 A032071

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net)

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 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.