This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A002888 M1919 N0757 #24 Jul 31 2024 09:14:45 %S A002888 1,2,9,20,670 %N A002888 a(n) is the cutting number of the tree corresponding to A002887(n). %D A002888 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. %D A002888 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A002888 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A002888 Frank Harary and Phillip A. Ostrand, <a href="https://doi.org/10.1016/0012-365X(71)90003-3">The cutting center theorem for trees</a>, Discrete Mathematics, 1 (1971), 7-18. %Y A002888 Cf. A002887, A331237. %K A002888 nonn,more %O A002888 1,2 %A A002888 _N. J. A. Sloane_ %E A002888 Title improved by _Sean A. Irvine_, Jan 16 2020