Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050383
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050383 Permutation rooted trees with n nodes. +0
2
1, 1, 3, 8, 25, 77, 262, 897, 3208, 11658, 43243, 162477, 618219, 2374699, 9200541, 35903017, 140997527, 556798525, 2209685939, 8807924914, 35248187347, 141564134395, 570402287162, 2305138038036, 9340981510156, 37946616550787 (list; graph; listen)
OFFSET

1,3

LINKS

C. G. Bower, Transforms (2)

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 773

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Shifts left under transform T where Ta is EULER(CIK(a)).

CROSSREFS

Cf. A004111, A005355.

Sequence in context: A148791 A148792 A007563 this_sequence A060404 A101490 A148793

Adjacent sequences: A050380 A050381 A050382 this_sequence A050384 A050385 A050386

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.

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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research