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.

A287062 Number of dominating sets in the 2n-crossed prism graph.

This page as a plain text file.
%I A287062 #14 Feb 16 2025 08:33:46
%S A287062 11,183,2417,32499,436281,5857683,78646537,1055926979,14177123321,
%T A287062 190345385523,2555621823337,34312378451619,460686046833881,
%U A287062 6185278996234003,83045007601555017,1114981764240774019,14970006873311301561,200990826015513435123
%N A287062 Number of dominating sets in the 2n-crossed prism graph.
%C A287062 Sequence extended to n=1 using recurrence. - _Andrew Howroyd_, May 21 2017
%H A287062 Andrew Howroyd, <a href="/A287062/b287062.txt">Table of n, a(n) for n = 1..200</a>
%H A287062 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CrossedPrismGraph.html">Crossed Prism Graph</a>
%H A287062 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DominatingSet.html">Dominating Set</a>
%H A287062 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (11, 31, 21, 2).
%F A287062 From _Andrew Howroyd_, May 21 2017 (Start)
%F A287062 a(n) = 11*a(n-1)+31*a(n-2)+21*a(n-3)+2*a(n-4).
%F A287062 G.f.: x*(11+62*x+63*x^2+8*x^3)/((1+x)*(1-12*x-19*x^2-2*x^3)).
%F A287062 (End)
%t A287062 LinearRecurrence[{11, 31, 21, 2}, {11, 183, 2417, 32499}, 20] (* _Eric W. Weisstein_, May 27 2017 *)
%t A287062 Table[(-1)^n + RootSum[-2 - 19 # - 12 #^2 + #^3 &, #^n &], {n, 20}] (* _Eric W. Weisstein_, May 27 2017 *)
%o A287062 (PARI)
%o A287062 Vec((11+62*x+63*x^2+8*x^3)/((1+x)*(1-12*x-19*x^2-2*x^3)) + O(x^20)) \\ _Andrew Howroyd_, May 21 2017
%K A287062 nonn
%O A287062 1,1
%A A287062 _Eric W. Weisstein_, May 19 2017
%E A287062 a(1) and a(8)-a(18) from _Andrew Howroyd_, May 21 2017