login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A002888
a(n) is the cutting number of the tree corresponding to A002887(n).
(Formerly M1919 N0757)
3
1, 2, 9, 20, 670
OFFSET
1,2
REFERENCES
Frank Harary and Phillip A. Ostrand, How cutting is a cut point?, pp. 147-150 of R. K. Guy et al., editors, Combinatorial Structures and Their Applications (Proceedings Calgary Conference Jun 1969), Gordon and Breach, NY, 1970.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Frank Harary and Phillip A. Ostrand, The cutting center theorem for trees, Discrete Mathematics, 1 (1971), 7-18.
CROSSREFS
Sequence in context: A100516 A337015 A041285 * A041963 A298912 A368187
KEYWORD
nonn,more
EXTENSIONS
Title improved by Sean A. Irvine, Jan 16 2020
STATUS
approved