Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032128
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032128 Number of dyslexic planted planar trees with n+1 nodes. +0
3
1, 1, 2, 4, 10, 25, 69, 193, 565, 1680, 5113, 15757, 49223, 155228, 493937, 1583002, 5106386, 16563542, 53995678, 176797966, 581196445, 1917446630, 6346554919, 21068877925, 70133571797, 234043258802, 782831380626 (list; graph; listen)
OFFSET

1,3
LINKS

Index entries for sequences related to rooted trees

FORMULA

Shifts left under "BIK" (reversible, indistinct, unlabeled) transform

CROSSREFS

Cf. A038035.

Sequence in context: A124344 A049125 A027432 this_sequence A052829 A001998 A005817

Adjacent sequences: A032125 A032126 A032127 this_sequence A032129 A032130 A032131

KEYWORD

nonn,eigen

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 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research

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