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 A350293 #8 Dec 25 2021 14:54:33 %S A350293 1,2,6,12,24,52,112 %N A350293 a(n) is the 1st saturated vertex Turán number for the cube graph Q_n. %C A350293 The 1st saturated vertex Turán number for the cube graph Q_n is the maximum number of vertices to be deleted from the cube graph such that no subgraph Q_1 is complete and each of the deleted vertices being added again completes a subgraph Q_1 (see Harborth and Nienborg). %H A350293 Heiko Harborth and Hauke Nienborg, <a href="https://www.researchgate.net/publication/266861957_Saturated_vertex_Turan_numbers_for_cube_graphs">Saturated vertex Turán numbers for cube graphs</a>, Congr. Num. 208 (2011), 183-188. %H A350293 Mathonline, <a href="http://mathonline.wikidot.com/cube-graphs">Cube Graphs</a> %F A350293 a(n) = n*2^n/(n + 1) iff n is a Mersenne number (see Theorem 1 in Harborth and Nienborg). %F A350293 a(n) <= A350294(n) (see Lemma 1 in Harborth and Nienborg). %Y A350293 First column of A350292. %Y A350293 Cf. A000225, A350294. %K A350293 nonn,more %O A350293 1,2 %A A350293 _Stefano Spezia_, Dec 23 2021