login
Number of edge cuts in the n-necklace graph.
0

%I #10 Feb 19 2026 09:32:55

%S 26,3228,245288,16475376,1068594080,68634500544,4396676135552,

%T 281453261528832,18014059077999104,1152916256700963840,

%U 73786895882044123136,4722365259900963975168,302231436421441859330048,19342812836033896156348416,1237940035129489722140426240,79228162452348235561534685184

%N Number of edge cuts in the n-necklace graph.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EdgeCut.html">Edge Cut</a>.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/NecklaceGraph.html">Necklace Graph</a>.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (92,-1988,12544).

%F a(n) = 64^n - (24*n + 14)*14^(n-1). - _Andrew Howroyd_, Feb 12 2026

%F G.f.: -2*x*(13+418*x)/((1-14*x)^2*(-1+64*x)). - _Eric W. Weisstein_, Feb 13 2026

%F a(n) = 92*a(n-1)-1988*a(n-2)+12544*a(n-3). - _Eric W. Weisstein_, Feb 13 2026

%t Table[64^n - 14^n (12 n + 7)/7, {n, 20}]

%t LinearRecurrence[{92, -1988, 12544}, {26, 3228, 245288}, 20]

%t CoefficientList[Series[-2 (13 + 418 x)/((1 - 14 x)^2 (-1 + 64 x)), {x, 0, 20}], x]

%K nonn,easy

%O 1,1

%A _Eric W. Weisstein_, Feb 12 2026

%E a(4) onward from _Andrew Howroyd_, Feb 12 2026