Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118313
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118313 Sum of squared end-to-end distances of the n-step self-avoiding walk on the simple cubic lattice. +0
1
0, 6, 72, 582, 4032, 25556, 153528, 886926, 4983456, 27401502, 148157880, 790096950, 4166321184, 21760624254, 11274379663, 580052260230, 2966294589312, 15087996161382, 76384144381272, 385066579325550 (list; graph; listen)
OFFSET

0,2

COMMENT

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 (mathar(AT)strw.leidenuniv.nl), Aug 31 2007

LINKS

D. MacDonald, S. Joseph, D. L. Hunter, L. L. Mosley, N. Jan and A. J. Guttmann, Self-avoiding walks on the simple cubic lattice,J Phys A: Math Gen 33 (2000) No 34, 5973-5983

N. Clisby, R. Liang and G. Slade Self-avoiding walk enumeration via the lace expansion J. Phys. A: Math. Theor. vol. 40 (2007) p 10973-11017, Table A5 for n<=30.

CROSSREFS

Cf. A001412.

Adjacent sequences: A118310 A118311 A118312 this_sequence A118314 A118315 A118316

Sequence in context: A052615 A052791 A129532 this_sequence A036292 A061690 A133678

KEYWORD

nonn

AUTHOR

R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 14 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research