Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032274
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032274 Number of labeled series-reduced dyslexic mobiles (polygon rooted trees) with n leaves (root has degree 0 or >=2). +0
1
1, 1, 4, 28, 277, 3532, 55093, 1016011, 21624349, 521677954, 14067076336, 419272679677, 13687252717378, 485693076265273, 18614089207916707, 766238746685395879, 33717600627620246296, 1579453179468556700596 (list; graph; listen)
OFFSET

1,3
LINKS

Index entries for sequences related to mobiles

FORMULA

Doubles (index 2+) under "DIJ" (bracelet, indistinct, labeled) transform.

CROSSREFS

Sequence in context: A129683 A081917 A128318 this_sequence A007559 A138208 A071212

Adjacent sequences: A032271 A032272 A032273 this_sequence A032275 A032276 A032277

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 December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research

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