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 A347536 #14 Feb 16 2025 08:34:02
%S A347536 3,15,27,48,75,108,147,192,243,300,363,432,507,588,675,768,867,972,
%T A347536 1083,1200,1323,1452,1587,1728,1875,2028,2187,2352,2523,2700,2883,
%U A347536 3072,3267,3468,3675,3888,4107,4332,4563,4800,5043,5292,5547,5808,6075,6348,6627
%N A347536 Number of minimum dominating sets in the complete tripartite graph K_{n,n,n}.
%H A347536 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CompleteTripartiteGraph.html">Complete Tripartite Graph</a>
%H A347536 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumDominatingSet.html">Minimum Dominating Set</a>
%H A347536 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A347536 a(n) = A033428(n) = 3*n^2 for n != 2.
%F A347536 G.f.: 3*x*(-1 - 2*x + 3*x^2 - 3*x^3 + x^4)/(-1 + x)^3.
%F A347536 From _Stefano Spezia_, Sep 06 2021: (Start)
%F A347536 E.g.f.: 3*x*(x + 2*exp(x)*(1 + x))/2.
%F A347536 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 5. (End)
%Y A347536 Cf. A291537, A290325.
%K A347536 nonn,easy
%O A347536 1,1
%A A347536 _Eric W. Weisstein_, Sep 05 2021