Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032065
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032065 Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different. +0
2
1, 1, 1, 2, 3, 6, 14, 31, 70, 163, 407, 984, 2445, 6089, 15412, 39189, 100217, 257720, 666068, 1729169, 4505362, 11784473, 30917383, 81358804, 214658044, 567792612, 1505281859, 3999183421, 10645793860 (list; graph; listen)
OFFSET

1,4
LINKS

Index entries for sequences related to rooted trees

FORMULA

Shifts left under "BGK" (reversible, element, unlabeled) transform.

CROSSREFS

Sequence in context: A106364 A006444 A032047 this_sequence A099968 A010357 A002995

Adjacent sequences: A032062 A032063 A032064 this_sequence A032066 A032067 A032068

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 July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.