A292881 Number of n-step closed paths on the E6 lattice.
1, 0, 72, 1440, 54216, 2134080, 93993120, 4423628160, 219463602120, 11341793393280
Offset: 0
Examples
The 2-step walks consist of hopping to one of the 72 minimal vectors of the E6 lattice and then back to the origin.
Links
- S. Savitz and M. Bintz, Exceptional Lattice Green's Functions, arXiv:1710.10260 [math-ph], 2017.
Crossrefs
Formula
Summed combinatorial expressions and recurrence relations for this sequence exist, but have not been determined. These would allow one to write a differential equation or hypergeometric expression for the E6 lattice Green's function.
Comments