cp's OEIS Frontend

A297047 Number of edge covers in the n-wheel graph.

%I A297047 #25 Feb 16 2025 08:33:52
%S A297047 0,2,10,41,154,562,2023,7240,25842,92129,328270,1169390,4165231,
%T A297047 14835316,52837774,188186161,670237602,2387090906,8501757271,
%U A297047 30279468752,107841945274,384084812929,1367938393414,4871984909782,17351831683935,61799465142812,220102059235510
%N A297047 Number of edge covers in the n-wheel graph.
%C A297047 Extended to a(1)-a(3) using the formula/recurrence.
%H A297047 Robert Israel, <a href="/A297047/b297047.txt">Table of n, a(n) for n = 1..1811</a>
%H A297047 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EdgeCover.html">Edge Cover</a>
%H A297047 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WheelGraph.html">Wheel Graph</a>
%H A297047 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,0,-5,-2).
%F A297047 a(n) = A206776(n-1) - A000032(n-1).
%F A297047 a(n) = 4*a(n-1) - 5*a(n-3) - 2*a(n-4).
%F A297047 G.f.: x^2*(2+2*x+x^2) / ( (x^2+x-1)*(2*x^2+3*x-1) ).
%F A297047 a(n) = 2^(-2-n)*(2*(1-sqrt(5))^n*(1+sqrt(5)) - 2*(-1+sqrt(5))*(1+sqrt(5))^n - 3*(3-sqrt(17))^n-sqrt(17)*(3-sqrt(17))^n - 3*(3+sqrt(17))^n+sqrt(17)*(3+sqrt(17))^n). - _Colin Barker_, Dec 28 2017
%p A297047 f:= gfun:-rectoproc({a(n) = 4*a(n-1) - 5*a(n-3) - 2*a(n-4),a(1)=0,a(2)=2,a(3)=10,a(4)=41},a(n),remember):
%p A297047 map(f, [$1..30]); # _Robert Israel_, Dec 26 2017
%t A297047 Table[I^(n - 1) 2^((n + 1)/2) ChebyshevT[n - 1, -3 I/(2 Sqrt[2])] - LucasL[n - 1, 1], {n, 20}]
%t A297047 LinearRecurrence[{4, 0, -5, -2}, {0, 2, 10, 41}, 20]
%t A297047 CoefficientList[Series[x (2 + 2 x + x^2)/(1 - 4 x + 5 x^3 + 2 x^4), {x, 0, 20}], x]
%o A297047 (PARI) first(n) = Vec(x^2*(2 + 2*x + x^2)/(1 - 4*x + 5*x^3 + 2*x^4) + O(x^(n+1)), -n) \\ _Iain Fox_, Dec 24 2017
%K A297047 nonn,easy
%O A297047 1,2
%A A297047 _Eric W. Weisstein_, Dec 24 2017