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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A367457 Number of maximal independent vertex sets in the n X n camel graph. 1
 1, 1, 1, 25, 300, 4761, 37908, 1408969, 42742245, 1650878161, 240427884762, 14943334966921, 4986511832627632, 793446864376246336, 451148370226544277049 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Table of n, a(n) for n=1..15. Eric Weisstein's World of Mathematics, Camel Graph. Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set. MATHEMATICA Table[Length@FindIndependentVertexSet[RelationGraph[Sort[Abs[Subtract[##]]] == {1, 3} &, Tuples[Range[n], 2]], Infinity, All], {n, 8}] PROG (Python) from networkx import empty_graph, complement, find_cliques def A367457(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, 3), (1, -3), (-1, 3), (-1, -3), (3, 1), (3, -1), (-3, 1), (-3, -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 10 21:39 EDT 2024. Contains 375058 sequences. (Running on oeis4.)