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 A127683 #13 Jan 26 2025 20:26:32
%S A127683 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,1,2,2,5,4,8,9,15,16,27,30,46,54,80,
%T A127683 96,139,167,237,292,403,501,687,862,1164,1472,1974,2512,3347,4274,
%U A127683 5668,7275,9604,12359,16278,21006,27597,35690,46819,60663,79478,103128
%N A127683 Number of non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets of the n-cycle graph having 2n isomorphic representatives.
%H A127683 R. Bisdorff and J.-L. Marichal, <a href="https://arxiv.org/abs/math/0701647">Counting non-isomorphic maximal independent sets of the n-cycle graph</a>, arXiv:math/0701647 [math.CO], 2007-2008.
%F A127683 a(n) = (1/2)*(A113788(n) - Sum_{d|n} mu(n/d)*A127682(d)).
%Y A127683 Cf. A113788, A127682.
%K A127683 easy,nonn
%O A127683 1,19
%A A127683 Jean-Luc Marichal (jean-luc.marichal(AT)uni.lu), Jan 24 2007