OFFSET
0,3
COMMENTS
From Pontus von Brömssen, Mar 17 2025: (Start)
The vertices of the cubes are required to have integer coordinates.
Also, a(n) is the independence number of the strong graph product C_{2n+1} X C_{2n+1} X C_{2n+1} (the (2n+1) X (2n+1) X (2n+1) "torus king graph"), where C_{2n+1} is the (2n+1)-cycle graph. (End)
REFERENCES
L. D. Baumert et al., A combinatorial packing problem, pp. 97-108 of SIAM-AMS Proceedings, published by American Mathematical Society, Providence, RI, Vol. 4, 1971.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
L. D. Baumert et al., A combinatorial packing problem, pp. 97-108 of SIAM-AMS Proceedings, published by American Mathematical Society, Providence, RI, Vol. 4, 1971. [Annotated scanned copy]
T. Bohman, R. Holzman, and V. Natarajan, On the Independence Numbers of the Cubes of Odd Cycles, The Electronic Journal of Combinatorics, Volume 20, Issue 3 (2013), #P10.
K. A. Mathew and P. R. J. Östergård, New lower bounds for the Shannon capacity of odd cycles, Designs, Codes and Cryptography, 84 (2016), 13-22.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(6) added and name clarified by Dan Stahlke, Mar 08 2025
STATUS
approved