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.

A003289 Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,1).

Original entry on oeis.org

1, 2, 4, 10, 30, 98, 328, 1140, 4040, 14542, 53060, 195624, 727790, 2728450, 10296720, 39084190, 149115456, 571504686, 2199310460, 8494701152, 32919635606, 127961125094, 498775164568, 1949112527750, 7634623480172
Offset: 1

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.

References

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

Crossrefs

Equals A001335(n+1) / 6 for n > 1.

Extensions

More terms and title improved by Sean A. Irvine, Feb 13 2016
a(23)-a(24) from Bert Dobbelaere, Jan 03 2019
a(25) from Bert Dobbelaere, Jan 15 2019