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 A290273 #14 Feb 16 2025 08:33:49
%S A290273 2,2,3,5,7,8,13,18,25,34,49,69,95,134,188,264,368,517,725,1015,1422,
%T A290273 1993,2794,3913,5484,7685,10769,15089,21144,29630,41518,58178,81523,
%U A290273 114237,160075,224308,314317,440442,617177,864830,1211861,1698141,2379551,3334390,4672376
%N A290273 Number of minimal dominating sets in the n-pan graph.
%C A290273 Extended to a(1)-a(2) using the recurrence.
%H A290273 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalDominatingSet.html">Minimal Dominating Set</a>
%H A290273 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PanGraph.html">Pan Graph</a>
%H A290273 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0, 1, 1, 1, 0, -1).
%F A290273 a(n) = a(n-2) + a(n-3) + a(n-4) - a(n-6).
%F A290273 G.f.: x*(2 + 2*x + x^2 + x^3 - 2*x^5)/(1 - x^2 - x^3 - x^4 + x^6).
%t A290273 Table[-RootSum[1 - #^2 - #^3 - #^4 + #^6 &, -9 #^n + 33 #^(n + 1) - 23 #^(n + 2) - 45 #^(n + 3) - 38 #^(n + 4) + #^(n + 5) &]/229, {n, 20}]
%t A290273 LinearRecurrence[{0, 1, 1, 1, 0, -1}, {2, 2, 3, 5, 7, 8}, 50]
%t A290273 CoefficientList[Series[(2 + 2 x + x^2 + x^3 - 2 x^5)/(1 - x^2 - x^3 - x^4 + x^6), {x, 0, 20}], x]
%K A290273 nonn,easy
%O A290273 1,1
%A A290273 _Eric W. Weisstein_, Jul 25 2017