cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

1, 4, 22, 140, 970, 7196, 56092, 452064, 3735700, 31484244, 269613896, 2339571468, 20529434520, 181871459580, 1624587752400, 14617165101216
Offset: 1

Views

Author

Keywords

Comments

Cf. A001337.

References

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

Crossrefs

Equals A001337(n+1) / 12 for n > 1.
Equals (n+1) * A005398(n+1) / 6 for n > 1.

Programs

Extensions

One more term and title improved by Sean A. Irvine, Feb 15 2016
a(15)-a(16) from Bert Dobbelaere, Jan 14 2019

A001337 Number of n-step polygons on f.c.c. lattice.

Original entry on oeis.org

0, 0, 48, 264, 1680, 11640, 86352, 673104, 5424768, 44828400, 377810928, 3235366752, 28074857616, 246353214240, 2182457514960, 19495053028800, 175405981214592
Offset: 1

Views

Author

Keywords

Comments

Number of n-step closed self-avoiding walks starting at the origin. - Bert Dobbelaere, Jan 14 2019

References

  • B. D. Hughes, Random Walks and Random Environments, Oxford 1995, vol. 1, p. 460.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Equals 12*A003287(n-1), n > 1.
Equals 2n*A005398(n).
Cf. A001336.

Extensions

a(15)-a(17) from Bert Dobbelaere, Jan 14 2019
Showing 1-2 of 2 results.