3,3

P^3_n is the cube of path graph P_n.

Given a graph G where each vertex is initially considered filled or unfilled, we apply the skew color change rule, which states that a vertex v becomes filled if and only if it is the unique empty neighbor of some other vertex in the graph. The failed skew zero forcing number of G, is the maximum cardinality of any subset S of vertices on which repeated application of the skew color change rule will not result in all vertices being filled.

Georg Fischer, Table of n, a(n) for n = 3..1000

Thomas Ansill, Bonnie Jacob, Jaime Penzellna, and Daniel Saavedra, Failed skew zero forcing on a graph, Linear Algebra and its Applications (2016) Vol. 509, 40-63.

Aidan Johnson, Andrew Vick, Rigoberto Flórez, and Darren A. Narayan, Failed Skew Zero Forcing Numbers of Path Powers and Circulant Graphs, AppliedMath (2025) Vol. 5, No. 2, 32.

Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).

a(n) = 3*floor((n-1)/4) + cos((n*Pi)/2) for n > 7.

G.f.: x^3*(1 + 2*x + x^3 - x^4 - x^6 + x^8)/((1 - x)^2*(1 + x)*(1 + x^2)). - Stefano Spezia, Jul 15 2022

CoefficientList[Series[x^3*(1 + 2*x + x^3 - x^4 - x^6 + x^8)/((1 - x)^2*(1 + x)*(1 + x^2)), {x, 0, 59}], x][[3 ;; -1]] (* Michael De Vlieger, Mar 28 2025 *)

Sequence in context: A369218 A097356 A083522 * A108942 A025561 A342169

Adjacent sequences: A355064 A355065 A355066 * A355068 A355069 A355070

nonn,easy

Aidan Johnson, Darren Narayan, and Andrew E. Vick, Jul 14 2022

approved