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 A370303 #6 Feb 14 2024 20:16:08 %S A370303 0,0,1,0,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,0,1,1, %T A370303 1,1,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,0,1,1,1,1, %U A370303 1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,2,2 %N A370303 a(n) = A370302(n)-A000523(n)-3. %C A370303 Consider a graph with the least possible number of vertices, containing an induced cycle of length k+3 for each k such that 2^k is a term in the binary expansion of n (cf. A370302). a(n) is the number of vertices in this graph in excess of the length of the longest required induced cycle (A000523(n)+3). (A370302(n) is the least total number of vertices.) %H A370303 Pontus von Brömssen, <a href="/A370303/b370303.txt">Table of n, a(n) for n = 1..1023</a> %F A370303 a(n) = 0 if and only if n is a power of 2. %Y A370303 Cf. A000523, A370302. %K A370303 nonn %O A370303 1,29 %A A370303 _Pontus von Brömssen_, Feb 14 2024