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 A120414 #63 Feb 16 2025 08:33:01
%S A120414 0,1,2,6,18,45,102,213,426,821,1538,2820,5075,8996,15743,27247,46709,
%T A120414 79405,133996,224640,374400
%N A120414 a(0)=0, a(1)=1; thereafter a(n) = ceiling((3/2)^(n-3)*n*(n-1)).
%C A120414 Original definition was "Conjectured Ramsey number R(n,n)."
%C A120414 R(m,n) = minimal number of nodes R such that in any graph with R nodes there is either an m-clique or an independent set of size n. This sequence gives the diagonal entries R(n,n).
%C A120414 Only these values have been proved: 0,1,2,6,18. a(5) is known to be in the range 43-49. - _N. J. A. Sloane_, Sep 16 2006
%C A120414 a(5) is at most 48, see the Angeltveit/McKay reference. - _Jurjen N.E. Bos_, Apr 11 2017
%C A120414 Ramsey numbers for simple binary partition.
%C A120414 Campos, Griffiths, Morris, & Sahasrabudhe prove that R(n,n) < 3.993^n for large enough n; they say the constant "could be improved further with some additional (straightforward, but somewhat technical) optimisation". This sequence posits a constant of 1.5. - _Charles R Greathouse IV_, Mar 18 2023
%D A120414 G. Berman and K. D. Fryer, Introduction to Combinatorics. Academic Press, NY, 1972, p. 175.
%H A120414 Vigleik Angeltveit and Brendan D. McKay, <a href="https://arxiv.org/abs/1703.08768">R(5,5) <= 48</a>, arXiv:1703.08768 [math.CO], 2017.
%H A120414 Marcelo Campos, Simon Griffiths, Robert Morris, and Julian Sahasrabudhe, <a href="https://arxiv.org/abs/2303.09521">An exponential improvement for diagonal Ramsey</a>, arXiv preprint arXiv:2303.09521 [math.CO], 2023.
%H A120414 R. E. Greenwood and A. M. Gleason, <a href="http://dx.doi.org/10.4153/CJM-1955-001-4">Combinatorial relations and chromatic graphs</a>, Canad. J. Math., 7 (1955), 1-7.
%H A120414 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RamseyNumber.html">Ramsey Number</a>
%H A120414 Wikipedia, <a href="http://en.wikipedia.org/wiki/Ramsey%27s_theorem">Ramsey's theorem</a>.
%t A120414 Join[{0,1},Table[Ceiling[(3/2)^(n-3) n(n-1)],{n,2,20}]] (* _Harvey P. Dale_, Aug 29 2024 *)
%Y A120414 Cf. A000791, A059442, A212954 (which have many more references).
%K A120414 easy,nonn
%O A120414 0,3
%A A120414 Jeff Boscole (jazzerciser(AT)hotmail.com), Jul 06 2006
%E A120414 Edited by _N. J. A. Sloane_, Sep 16 2006
%E A120414 This was initially submitted as a conjecture for the Ramsey number R(n,n). I have replaced the definition with the exct formula that was used. - _N. J. A. Sloane_, Nov 05 2023