login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A005547
Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (1,2,3).
(Formerly M3158)
7
3, 52, 575, 5470, 49303, 436446, 3850752, 34063392, 302790797, 2706629188, 24332099665, 219940720414
OFFSET
3,1
COMMENTS
McKenzie's paper incorrectly gives a(11) = 303790797. - Sean A. Irvine, Feb 17 2016
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
KEYWORD
nonn,walk
EXTENSIONS
a(11) corrected, more terms, and title improved by Sean A. Irvine, Feb 17 2016
STATUS
approved