|
|
A292881
|
|
Number of n-step closed paths on the E6 lattice.
|
|
2
|
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Calculated by brute force computational enumeration.
The moments of the imaginary part of the suitably normalized E6 lattice Green's function.
|
|
LINKS
|
|
|
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.
|
|
EXAMPLE
|
The 2-step walks consist of hopping to one of the 72 minimal vectors of the E6 lattice and then back to the origin.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,walk,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|