close
login
A393348
Number of edge cuts in the n-necklace graph.
0
26, 3228, 245288, 16475376, 1068594080, 68634500544, 4396676135552, 281453261528832, 18014059077999104, 1152916256700963840, 73786895882044123136, 4722365259900963975168, 302231436421441859330048, 19342812836033896156348416, 1237940035129489722140426240, 79228162452348235561534685184
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Edge Cut.
Eric Weisstein's World of Mathematics, Necklace Graph.
FORMULA
a(n) = 64^n - (24*n + 14)*14^(n-1). - Andrew Howroyd, Feb 12 2026
G.f.: -2*x*(13+418*x)/((1-14*x)^2*(-1+64*x)). - Eric W. Weisstein, Feb 13 2026
a(n) = 92*a(n-1)-1988*a(n-2)+12544*a(n-3). - Eric W. Weisstein, Feb 13 2026
MATHEMATICA
Table[64^n - 14^n (12 n + 7)/7, {n, 20}]
LinearRecurrence[{92, -1988, 12544}, {26, 3228, 245288}, 20]
CoefficientList[Series[-2 (13 + 418 x)/((1 - 14 x)^2 (-1 + 64 x)), {x, 0, 20}], x]
CROSSREFS
Sequence in context: A172010 A283571 A377637 * A283041 A183068 A173130
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Feb 12 2026
EXTENSIONS
a(4) onward from Andrew Howroyd, Feb 12 2026
STATUS
approved