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 A267296 #18 Sep 14 2019 06:38:46 %S A267296 3,3,9,14,15,22,25,34,37,46,49 %N A267296 Circulant Ramsey numbers RC_1(3,n) of the first kind. %C A267296 The smallest positive number a(n), such that any triangle-free cyclic (also known as circulant) graph with a(n) vertices has independence number at least n. The terminology and the terms given here are from Harborth and Krause. %C A267296 a(n) <= A267295(n) for all n. %C A267296 Moreover, the sequence is related to the ordinary two-color Ramsey numbers R(3,n), given in A000791, by the relation a(n) <= A000791(n) for all n, as proved by Kalbfleisch. This inequality is known to be an equality for n = 2 or 4 <= n <= 5. %D A267296 H. Harborth, S. Krause, Ramsey Numbers for Circulant Colorings, Congressus Numerantium 161 (2003), 139-150. %H A267296 <a href="/index/Ra#Ramsey numbers">Index entries for sequences related to Ramsey numbers</a> %Y A267296 Cf. A000791, A267295. %K A267296 nonn,hard,more %O A267296 2,1 %A A267296 _Jörgen Backelin_, Jan 12 2016