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 A347634 #7 Feb 16 2025 08:34:02
%S A347634 2,8,6,4,10,48,14,4,18,120,22,4,26,224,30,4,34,360,38,4,42,528,46,4,
%T A347634 50,728,54,4,58,960,62,4,66,1224,70,4,74,1520,78,4,82,1848,86,4,90,
%U A347634 2208,94,4,98,2600,102,4,106,3024,110,4,114,3480,118,4,122,3968
%N A347634 Number of minimum dominating sets in the n-prism graph (for n > 3 except n = 6).
%C A347634 The numbers of minimum dominating sets in the n-prism graph differ at n = 3 (9 minimum sets) and n = 6 (51 minimum sets).
%H A347634 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumDominatingSet.html">Minimum Dominating Set</a>
%H A347634 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrismGraph.html">Prism Graph</a>
%H A347634 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,3,0,0,0,-3,0,0,0,1).
%F A347634 a(n) = 4 for n = 0 (mod 4)
%F A347634 2*n for n = 1 (mod 2)
%F A347634 n*(n+2) for n = 2 (mod 4).
%F A347634 a(n) = 3*a(n-4)-3*a(n-8)+a(n-12) for n > 12.
%t A347634 Table[Piecewise[{{4, Mod[n, 4] == 0}, {2 n, Mod[n, 2] == 1}, {n (n + 2), Mod[n, 4] == 2}}], {n, 20}]
%t A347634 LinearRecurrence[{0, 0, 0, 3, 0, 0, 0, -3, 0, 0, 0, 1}, {2, 8, 6, 4, 10, 48, 14, 4, 18, 120, 22, 4}, 20]
%K A347634 nonn
%O A347634 1,1
%A A347634 _Eric W. Weisstein_, Sep 09 2021