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 A290709 #16 Feb 16 2025 08:33:50
%S A290709 4,22,49,94,169,298,529,958,1777,3370,6505,12718,25081,49738,98977,
%T A290709 197374,394081,787402,1573945,3146926,6292777,12584362,25167409,
%U A290709 50333374,100665169,201328618,402655369,805308718,1610615257,3221228170,6442453825,12884904958
%N A290709 Number of irredundant sets in the complete tripartite graph K_{n,n,n}.
%C A290709 When n > 1, the nonempty irredundant sets are those consisting of either any number of vertices from a single partition or otherwise exactly two vertices from different partitions. - _Andrew Howroyd_, Aug 10 2017
%H A290709 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CompleteTripartiteGraph.html">Complete Tripartite Graph</a>
%H A290709 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IrredundantSet.html">Irredundant Set</a>
%H A290709 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (5, -9, 7, -2).
%F A290709 a(n) = 3*(2^n + n^2) - 2 for n > 1. - _Andrew Howroyd_, Aug 10 2017
%F A290709 a(n) = 5*a(n-1) - 9*a(n-2) + 7*a(n-3) - 2*a(n-4) for n > 5.
%F A290709 G.f.: (x (4 + 2 x - 25 x^2 + 19 x^3 - 6 x^4))/((-1 + x)^3 (-1 + 2 x)).
%t A290709 Table[If[n == 1, 4, 3 (2^n + n^2) - 2], {n, 20}]
%t A290709 Join[{4}, LinearRecurrence[{5, -9, 7, -2}, {22, 49, 94, 169}, 20]]
%t A290709 CoefficientList[Series[(4 + 2 x - 25 x^2 + 19 x^3 - 6 x^4)/((-1 + x)^3 (-1 + 2 x)), {x, 0, 20}], x]
%o A290709 (PARI) a(n) = if(n==1, 4, 3*(2^n + n^2) - 2); \\ _Andrew Howroyd_, Aug 10 2017
%Y A290709 Cf. A290707.
%K A290709 nonn
%O A290709 1,1
%A A290709 _Eric W. Weisstein_, Aug 09 2017
%E A290709 a(7)-a(32) from _Andrew Howroyd_, Aug 10 2017