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 A127684 #6 Jul 21 2017 16:33:52 %S A127684 0,1,1,0,1,0,1,1,1,1,2,2,3,3,2,5,5,6,7,9,7,13,12,16,15,24,19,32,28,44, %T A127684 37,58,46,81,63,104,86,145,110,189,151,257,200,339,260,460,351,599, %U A127684 464,813,610,1069,816,1431,1078,1889,1424,2530,1897,3323,2513,4452,3319 %N A127684 Number of non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets of the n-cycle graph having n isomorphic representatives. %H A127684 R. Bisdorff and J.-L. Marichal, <a href="http://arXiv.org/abs/math.CO/0701647">Counting non-isomorphic maximal independent sets of the n-cycle graph</a>, arXiv:0701647 (2007) and <a href="https://cs.uwaterloo.ca/journals/JIS/VOL11/Marichal/marichal.html">JIS 11 (2008) 08.5.7</a>. %F A127684 a(n) = (Sum(d divides n) mu(n/d) A127682(d)) + (A127683(n/2)*[n even]). %F A127684 a(n) = (Sum(d divides n) mu(n/d) A127682(d)) + (A127683(n/2)*[n even]) %Y A127684 Cf. A127682, A127683. %K A127684 easy,nonn %O A127684 1,11 %A A127684 Jean-Luc Marichal (jean-luc.marichal(AT)uni.lu), Jan 24 2007