|
Search: id:A005355
|
|
|
| A005355 |
|
Number of asymmetric permutation rooted trees with n nodes.
(Formerly M2680)
|
|
+0
2
|
|
| 0, 1, 1, 1, 3, 7, 21, 61, 187, 577, 1825, 5831, 18883, 61699, 203429, 675545, 2258291, 7592249, 25656477, 87096661, 296891287, 1015797379, 3487272317, 12008898531, 41471260883, 143588078449, 498343911529, 1733410858955
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Labelle, Gilbert; Counting asymmetric enriched trees. J. Symbolic Comput. 14 (1992), no. 2-3, 211-242.
|
|
LINKS
|
Index entries for sequences related to rooted trees
|
|
FORMULA
|
Shifts left under transform T where Ta has g.f. (1-A(x^2))/(1-A(x)).
|
|
CROSSREFS
|
Cf. A004111, A050383.
Sequence in context: A056779 A102877 A122983 this_sequence A025235 A129366 A166358
Adjacent sequences: A005352 A005353 A005354 this_sequence A005356 A005357 A005358
|
|
KEYWORD
|
nonn,nice,easy,eigen
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe, Susanna Cuyler
|
|
EXTENSIONS
|
More terms, formula from Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.
|
|
|
Search completed in 0.002 seconds
|
