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 A335687 #13 Jul 14 2020 10:07:38 %S A335687 4,12,32,69,121,191,304,432,582,799,1042,1320,1661,2043,2457,3023, %T A335687 3575,4195,4920,5693,6465,7487,8502,9617,10833,12173,13526,15146, %U A335687 16693,18397,20286,22327,24201,26603,28841,31372,34025,36873,39583,42913,46029 %N A335687 (A331763(n) - A331755(n+1))/2. %C A335687 One-half of ((number of vertices in graph SC(n,2)) - (number of vertices in graph SC(n,1))). %C A335687 It would be nice to have a formula for this sequence. The graphs SC(n,1) are fairly well understood, while SC(n,m) is basically a mystery for m >= 2. %C A335687 Note that the offsets in A331755 and A331763 have different meanings, which is why there is an extra "+1" in the definition of the current sequence. %H A335687 N. J. A. Sloane, <a href="/A335687/b335687.txt">Table of n, a(n) for n = 1..100</a> %H A335687 Scott R. Shannon, <a href="/A331452/a331452_7.png">Colored illustration for the graph SC(2,1)</a> %H A335687 Scott R. Shannon, <a href="/A331452/a331452_12.png">Colored illustration for the graph SC(2,2)</a> %e A335687 For n=2, SC(2,2) has 37 vertices and SC(2,1) has 13 vertices (see illustrations), so a(2) = (37-13)/2 = 12. %Y A335687 Cf. A331452, A331755, A331763. %K A335687 nonn %O A335687 1,1 %A A335687 _N. J. A. Sloane_, Jul 14 2020