The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A367458 Number of maximal independent vertex sets in the n X n giraffe graph. 1
 1, 1, 1, 1, 90, 3098, 69369, 3087085, 29206276, 4615678629, 464716001925 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Table of n, a(n) for n=1..11. Eric Weisstein's World of Mathematics, Giraffe Graph. Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set. MATHEMATICA Table[Length@FindIndependentVertexSet[RelationGraph[Sort[Abs[Subtract[##]]] == {1, 4} &, Tuples[Range[n], 2]], Infinity, All], {n, 7}] PROG (Python) from networkx import empty_graph, complement, find_cliques def A367458(n): G = empty_graph((i, j) for i in range(n) for j in range(n)) G.add_edges_from(((i, j), (i+k, j+l)) for i in range(n) for j in range(n) for (k, l) in ((1, 4), (1, -4), (-1, 4), (-1, -4), (4, 1), (4, -1), (-4, 1), (-4, -1)) if 0<=i+k

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 14 18:14 EDT 2024. Contains 375166 sequences. (Running on oeis4.)