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!)
A000767 Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 2.
(Formerly M5017 N2162)
4

%I M5017 N2162 #24 Dec 19 2021 09:45:37

%S 16,192,2016,20160,197940,1930944,18805488,183156320,1785303660,

%T 17421627280,170214459928,1665089608504,16307758577692,159896665015064

%N Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 2.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

%H J. L. Martin, <a href="http://dx.doi.org/10.1017/S0305004100036240">The exact enumeration of self-avoiding walks on a lattice</a>, Proc. Camb. Phil. Soc., 58 (1962), 92-101.

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

%Y Cf. A000765, A000766, A000768, A001336, A227511.

%K nonn,walk,more

%O 2,1

%A _N. J. A. Sloane_

%E Edited and extended by _Joseph Myers_, Jul 14 2013

%E a(12)-a(15) from _Bert Dobbelaere_, Jan 13 2019

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 May 9 23:14 EDT 2024. Contains 372354 sequences. (Running on oeis4.)