|
Search: id:A007098
|
|
|
| A007098 |
|
Number of unlabeled bisectable trees with 2n+1 nodes.
(Formerly M2596)
|
|
+0
1
|
|
| 1, 1, 3, 6, 19, 47, 140, 374, 1082, 2998, 8574, 24130, 68876, 195587, 559076, 1596651, 4575978, 13122219, 37711998, 108488765, 312577827, 901531937, 2603264050, 7524331268, 21768850808, 63032844756, 182662328945, 529722408615, 1537261773438
(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).
Harary, Frank; Robinson, Robert W.; Isomorphic factorizations. VIII. Bisectable trees. Combinatorica 4 (1984), no. 2-3, 169-179.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1980.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 0..99
Index entries for sequences related to trees
|
|
CROSSREFS
|
Sequence in context: A108972 A019097 A104264 this_sequence A148566 A148567 A148568
Adjacent sequences: A007095 A007096 A007097 this_sequence A007099 A007100 A007101
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein (mira(AT)math.berkeley.edu)
|
|
EXTENSIONS
|
a(23) onwards added by N. J. A. Sloane (njas(AT)research.att.com), Oct 19 2006 from the Robinson reference
|
|
|
Search completed in 0.002 seconds
|
