This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A292882 #12 Oct 31 2017 12:37:47 %S A292882 1,0,126,4032,228690,14394240,1020623940,78353170560,6393827197170 %N A292882 Number of n-step closed paths on the E7 lattice. %C A292882 Calculated by brute force computational enumeration. %C A292882 The moments of the imaginary part of the suitably normalized E7 lattice Green's function. %H A292882 S. Savitz and M. Bintz, <a href="https://arxiv.org/abs/1710.10260">Exceptional Lattice Green's Functions</a>, arXiv:1710.10260 [math-ph], 2017. %F A292882 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 E7 lattice Green's function. %e A292882 The 2-step walks consist of hopping to one of the 126 minimal vectors of the E7 lattice and then back to the origin. %Y A292882 Cf. A126869 (Linear A1 lattice), A002898 (Hexagonal A2), A002899 (FCC A3), A271432 (D4), A271650 (D5), A292881 (E6), A271651 (D6), A271670 (D7), A292883 (E8), A271671 (D8). %K A292882 nonn,walk,more %O A292882 0,3 %A A292882 _Samuel Savitz_, Sep 26 2017