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 A347638 #11 Feb 16 2025 08:34:02
%S A347638 3,7,10,15,16,18,29,31,40,48,67,82,105,143,189,255,341,474,647,892,
%T A347638 1236,1719,2393,3330,4656,6503,9094,12719,17807,24931,34907,48895,
%U A347638 68490,95951,134420,188338,263885,369743,518080,725940,1017211,1425346,1997265,2798671
%N A347638 Number of minimal dominating sets in the n-dipyramidal graph (for n > 3).
%C A347638 The 3-dipyramidal graph deviates from this sequence because it has 4 minimal dominating sets while a(3) = 10.
%H A347638 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DipyramidalGraph.html">Dipyramidal Graph</a>
%H A347638 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalDominatingSet.html">Minimal Dominating Set</a>
%H A347638 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1,0,-1,0,2,-1).
%F A347638 a(n) = A253413(n)+2*n+1.
%F A347638 a(n) = 2*a(n-1)-a(n-3)-a(n-5)+2*a(n-7)-a(n-8).
%F A347638 G.f.: x*(3+x-4*x^2-2*x^3-7*x^4-x^5+15*x^6-7*x^7)/((-1+x)^2*(1-x^2-x^3-x^4+x^6)).
%t A347638 Table[2 n + 1 + RootSum[1 - #^2 - #^3 - #^4 + #^6 &, #^n &], {n, 20}]
%t A347638 LinearRecurrence[{2, 0, -1, 0, -1, 0, 2, -1}, {3, 7, 10, 15, 16, 18, 29, 31}, 20]
%t A347638 CoefficientList[Series[(3 + x - 4 x^2 - 2 x^3 - 7 x^4 - x^5 + 15 x^6 - 7 x^7)/((-1 + x)^2 (1 - x^2 - x^3 - x^4 + x^6)), {x, 0, 20}], x]
%Y A347638 Cf. A253413.
%K A347638 nonn,easy
%O A347638 1,1
%A A347638 _Eric W. Weisstein_, Sep 09 2021