login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005547 Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (1,2,3).
(Formerly M3158)
7

%I M3158 #21 Nov 06 2022 19:34:35

%S 3,52,575,5470,49303,436446,3850752,34063392,302790797,2706629188,

%T 24332099665,219940720414

%N Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (1,2,3).

%C McKenzie's paper incorrectly gives a(11) = 303790797. - _Sean A. Irvine_, Feb 17 2016

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H D. S. McKenzie, <a href="http://dx.doi.org/10.1088/0305-4470/6/3/009">The end-to-end length distribution of self-avoiding walks</a>, J. Phys. A 6 (1973), 338-352.

%H <a href="/index/Fa#fcc">Index entries for sequences related to f.c.c. lattice</a>

%Y Cf. A003287, A003288, A005543, A005544, A005545, A005546, A005548.

%K nonn,walk

%O 3,1

%A _N. J. A. Sloane_

%E a(11) corrected, more terms, and title improved by _Sean A. Irvine_, Feb 17 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)