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!)
A003287 Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,1,1).
(Formerly M3588)
8
1, 4, 22, 140, 970, 7196, 56092, 452064, 3735700, 31484244, 269613896, 2339571468, 20529434520, 181871459580, 1624587752400, 14617165101216 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Cf. A001337.
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
D. S. McKenzie, The end-to-end length distribution of self-avoiding walks, J. Phys. A 6 (1973), 338-352.
MATHEMATICA
A001337 = Cases[Import["https://oeis.org/A001337/b001337.txt", "Table"], {_, _}][[All, 2]];
a[n_] := If[n == 1, 1, A001337[[n + 1]]/12];
a /@ Range[16] (* Jean-François Alcover, Jan 20 2020 *)
CROSSREFS
Equals A001337(n+1) / 12 for n > 1.
Equals (n+1) * A005398(n+1) / 6 for n > 1.
Sequence in context: A002293 A181784 A369126 * A077056 A227404 A366677
KEYWORD
nonn,walk,more
AUTHOR
EXTENSIONS
One more term and title improved by Sean A. Irvine, Feb 15 2016
a(15)-a(16) from Bert Dobbelaere, Jan 14 2019
STATUS
approved

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 3 20:15 EDT 2024. Contains 372222 sequences. (Running on oeis4.)