A366410 Number of linearly independent solutions to the neighbor sum problem on a cubical (3n-1) X (3n-1) X (3n-1) chessboard.
0, 3, 0, 15, 6, 3, 0, 15, 0, 9, 0, 15, 0, 3, 6, 15
Offset: 1
Examples
The case of n=2 corresponds to a 5 X 5 X 5 chessboard. One solution is shown below with +1 and -1 denoted just by + and - respectively. Switching coordinate axis gives two other independent solutions and so a(2) = 3. In each of these solutions a +1 (or -1) is adjacent to exactly one other and each 0 is adjacent to an equal number of +1's and -1's. + + 0 - - 0 0 0 0 0 - - 0 + + 0 0 0 0 0 + + 0 - - 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 - - 0 + + 0 0 0 0 0 + + 0 - - 0 0 0 0 0 - - 0 + + 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 + + 0 - - 0 0 0 0 0 - - 0 + + 0 0 0 0 0 + + 0 - -
Links
- Sayan Dutta, Ayanava Mandal, Sohom Gupta, and Sourin Chatterjee,Neighbour Sum Patterns: Chessboards to Toroidal Worlds, arXiv:2310.04401 [math.NT], 2023.
Formula
If n is divisible by 2 or 5, then a(n) is nonzero (see Theorem 29 of Dutta et al. link).
It is conjectured that if a(n) is nonzero, then n is divisible by 2 or 5.
Comments