login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A362498
Number of vertex cuts in the n X n knight graph.
0
0, 0, 256, 48745, 22577890, 50785004331, 447911805432769, 15359769797452095985
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Knight Graph
Eric Weisstein's World of Mathematics, Vertex Cut
FORMULA
a(n) = 2^(n^2) - 1 - A290765(n) for n >= 4. - Pontus von Brömssen, Apr 23 2023
CROSSREFS
Cf. A290765.
Sequence in context: A181251 A132637 A114850 * A017440 A237068 A204302
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Apr 22 2023
EXTENSIONS
a(6)-a(8) (based on data in A290765) from Pontus von Brömssen, Apr 23 2023
STATUS
approved