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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002888 Cutting numbers of graphs.
(Formerly M1919 N0757)
0
1, 2, 9, 20, 670 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

F. Harary and P. 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

Table of n, a(n) for n=1..5.

CROSSREFS

Sequence in context: A002360 A100516 A041285 * A041963 A298912 A005476

Adjacent sequences:  A002885 A002886 A002887 * A002889 A002890 A002891

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 20:57 EST 2019. Contains 319282 sequences. (Running on oeis4.)