login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007098 Number of unlabeled bisectable trees with 2n+1 nodes.
(Formerly M2596)
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; refs; listen; history; internal format)
OFFSET

0,3

REFERENCES

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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

R. W. Robinson, Table of n, a(n) for n = 0..99

Index entries for sequences related to trees

CROSSREFS

Sequence in context: A203797 A019097 A104264 * A148566 A148567 A148568

Adjacent sequences:  A007095 A007096 A007097 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:04 EST 2012. Contains 205663 sequences.