login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002888 a(n) is the cutting number of the tree corresponding to A002887(n).
(Formerly M1919 N0757)
3
1, 2, 9, 20, 670 (list; graph; refs; listen; history; text; internal format)
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,changed
AUTHOR
EXTENSIONS
Title improved by Sean A. Irvine, Jan 16 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 04:50 EDT 2024. Contains 375085 sequences. (Running on oeis4.)