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.

A367644 Number of maximal independent vertex sets and minimal vertex covers in the n-trapezohedral graph.

This page as a plain text file.
%I A367644 #11 Feb 16 2025 08:34:06
%S A367644 3,3,6,11,18,30,52,91,159,278,487,854,1498,2628,4611,8091,14198,24915,
%T A367644 43722,76726,134644,236283,414647,727654,1276943,2240878,3932466,
%U A367644 6900996,12110403,21252275,37295142,65448411,114853954,201554638,353703732,620706779
%N A367644 Number of maximal independent vertex sets and minimal vertex covers in the n-trapezohedral graph.
%C A367644 Extended to n=1 using the formula/recurrence.
%H A367644 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>
%H A367644 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalVertexCover.html">Minimal Vertex Cover</a>
%H A367644 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TrapezohedralGraph.html">Trapezohedral Graph</a>
%H A367644 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,2,-1).
%F A367644 a(n) = A001608(2n) + 1.
%F A367644 a(n) = A109377(n+2) + 1.
%F A367644 a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3) - a(n-4).
%F A367644 G.f.: x*(3-6*x+6*x^2-4*x^3)/(1-3*x+3*x^2-2*x^3+x^4).
%t A367644 Table[1 + RootSum[-1 + # - 2  #^2 + #^3 &, #^n &], {n, 0, 20}]
%t A367644 LinearRecurrence[{3, -3, 2, -1}, {3, 3, 6, 11}, 20]
%t A367644 CoefficientList[Series[(3 - 6 x + 6 x^2 - 4 x^3)/(1 - 3 x + 3 x^2 - 2 x^3 + x^4), {x, 0, 20}], x]
%Y A367644 Cf. A001608, A109377.
%K A367644 nonn,easy
%O A367644 1,1
%A A367644 _Eric W. Weisstein_, Nov 25 2023