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 A347553 #20 Feb 16 2025 08:34:02
%S A347553 1,4,5,9,14,20,27,35,44,54,65,77,90,104,119,135,152,170,189,209,230,
%T A347553 252,275,299,324,350,377,405,434,464,495,527,560,594,629,665,702,740,
%U A347553 779,819,860,902,945,989,1034,1080,1127,1175,1224,1274,1325,1377,1430
%N A347553 Number of minimum dominating sets in the n-cycle complement graph.
%H A347553 John Konvalina, <a href="https://doi.org/10.1016/0097-3165(81)90006-6">On the number of combinations without unit separation</a>, Journal of Combinatorial Theory, Series A 31.2 (1981): 101-107. See Table II, row k=2.
%H A347553 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CycleComplementGraph.html">Cycle Complement Graph</a>
%H A347553 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumDominatingSet.html">Minimum Dominating Set</a>
%H A347553 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A347553 a(n) = n*(n - 3)/2 for n > 4.
%F A347553 G.f.: x^3*(-1 - x + 4*x^2 - 5*x^3 + 2*x^4)/(-1 + x)^3.
%F A347553 From _Stefano Spezia_, Sep 08 2021: (Start)
%F A347553 E.g.f.: x*(12 + 6*exp(x)*(x - 2) + 6*x + 2*x^2 + x^3)/12.
%F A347553 a(n) = 3*a(n-1) - 3*a(n-3) + a(n-3) for n > 4. (End)
%t A347553 Join[{1, 4}, Table[n(n-3)/2, {n, 5, 20}]]
%t A347553 CoefficientList[Series[x^3(-1 - x + 4 x^2 - 5 x^3 + 2 x^4)/(-1 + x)^3, {x, 0, 20}], x]
%Y A347553 Essentially the same as A000096.
%K A347553 nonn,easy
%O A347553 3,2
%A A347553 _Eric W. Weisstein_, Sep 06 2021