|
Search: id:A001669
|
|
|
| A001669 |
|
Number of 7-level labeled rooted trees with n leaves.
(Formerly M4443 N1879)
|
|
+0
14
|
|
| 1, 1, 7, 70, 910, 14532, 274778, 5995892, 148154860, 4085619622, 124304629050, 4133867297490, 149114120602860, 5796433459664946, 241482353893283349, 10730629952953517859, 506500241174366575122, 25302666611855946733140
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
J. Ginsburg, Iterated exponentials, Scripta Math., 11 (1945), 340-353.
T. Hogg and B. A. Huberman, Attractors on finite sets: the dissipative dynamics of computing structures, Phys. Review A 32 (1985), 2338-2346.
|
|
LINKS
|
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 296
Index entries for sequences related to rooted trees
|
|
FORMULA
|
E.g.f.: exp(exp(exp(exp(exp(exp(exp(x)-1)-1)-1)-1)-1)-1).
|
|
MAPLE
|
g:= proc(p) local b; b:=proc(n) option remember; if n=0 then 1 else (n-1)! *add (p(k)*b(n-k)/ (k-1)!/ (n-k)!, k=1..n) fi end end: a:= g(g(g(g(g(g(1)))))): seq (a(n), n=0..30); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 11 2008]
|
|
CROSSREFS
|
Cf. A000110, A000258, A000307, A000357, A000405.
Sequence in context: A113343 A124566 A141151 this_sequence A051604 A097630 A090647
Adjacent sequences: A001666 A001667 A001668 this_sequence A001670 A001671 A001672
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Extended with new definition by Christian G. Bower (bowerc(AT)usa.net), Aug 15 1998.
|
|
|
Search completed in 0.002 seconds
|
