cp's OEIS Frontend

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.

A118313 Sum of squared end-to-end distances of all n-step self-avoiding walks on the simple cubic lattice.

Original entry on oeis.org

0, 6, 72, 582, 4032, 25566, 153528, 886926, 4983456, 27401502, 148157880, 790096950, 4166321184, 21760624254, 112743796632, 580052260230, 2966294589312, 15087996161382, 76384144381272, 385066579325550, 1933885653380544, 9679153967272734, 48295148145655224, 240292643254616694, 1192504522283625600, 5904015201226909614, 29166829902019914840, 143797743705453990030, 707626784073985438752, 3476154136334368955958, 17048697241184582716248, 83487969681726067169454, 408264709609407519880320, 1993794711631386183977574, 9724709261537887936102872, 47376158929939177384568598, 230547785968352575619933376
Offset: 0

Views

Author

R. J. Mathar, May 14 2006

Keywords

Comments

Number of walks is A001412(n).
a(5) is 25556 according to MacDonald et al., but 25566 according to Clisby et al. and is therefore conjectural for now. - R. J. Mathar, Aug 31 2007
Confirmed that a(5) is 25566 [from Nathan Clisby]. Right-hand column, table, p.5 of Schram.

Crossrefs

Extensions

a(5) corrected by Nathan Clisby, Nov 24 2010
a(14), a(22) corrected by Hugo Pfoertner, Aug 13 2011