cp's OEIS Frontend

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.

A332392 Number of minimal total dominating sets in the 2 X n king graph.

This page as a plain text file.
%I A332392 #8 May 22 2025 22:33:53
%S A332392 1,1,6,10,15,52,105,175,481,1028,2000,4821,10368,21285,48625,105889,
%T A332392 224578,498106,1084331,2331760,5121797,11162455,24152665,52751528,
%U A332392 114914016,249490481,543949956,1184591233,2575134753,5608825345,12212701582,26569155354,57849402071
%N A332392 Number of minimal total dominating sets in the 2 X n king graph.
%H A332392 Andrew Howroyd, <a href="/A332392/b332392.txt">Table of n, a(n) for n = 0..1000</a>
%H A332392 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KingGraph.html">King Graph</a>.
%H A332392 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalTotalDominatingSet.html">Minimal Total Dominating Set</a>.
%H A332392 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,5,4,8,16,-8,-48,-64).
%F A332392 a(n) = a(n-2) + 5*a(n-3) + 4*a(n-4) + 8*a(n-5) + 16*a(n-6) - 8*a(n-7) - 48*a(n-8) - 64*a(n-9) for n >= 9.
%F A332392 G.f.: (1 + x + 5*x^2 + 4*x^3 - 8*x^6 - 48*x^7 - 64*x^8)/(1 - x^2 - 5*x^3 - 4*x^4 - 8*x^5 - 16*x^6 + 8*x^7 + 48*x^8 + 64*x^9).
%o A332392 (PARI) Vec((1 + x + 5*x^2 + 4*x^3 - 8*x^6 - 48*x^7 - 64*x^8)/(1 - x^2 - 5*x^3 - 4*x^4 - 8*x^5 - 16*x^6 + 8*x^7 + 48*x^8 + 64*x^9) + O(x^40))
%Y A332392 Row n=2 of A332390.
%K A332392 nonn
%O A332392 0,3
%A A332392 _Andrew Howroyd_, Feb 10 2020