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.

A336492 Total number of neighbor contacts for n-step self-avoiding walks on a 2D square lattice.

Original entry on oeis.org

0, 0, 8, 32, 152, 512, 1880, 5920, 19464, 59168, 183776, 545392, 1638400, 4778000, 14043224, 40422544, 116977176, 333346928, 953538440, 2695689520, 7642091352, 21464794032, 60417010152, 168787016352, 472315518008, 1313548558528, 3657850909680, 10133559518800
Offset: 1

Views

Author

Scott R. Shannon, Jul 23 2020

Keywords

Comments

This sequence gives the total number of neighbor contacts for all n-step self avoiding walks on a 2D square lattices. A neighbor contact is when the walk comes within 1 unit distance of a previously visited point, excluding the previous adjacent point.

Examples

			a(1) = a(2) = 0 as a 1 and 2 step walk cannot approach a previous step.
a(3) = 8. The single walk where one interaction occurs, which can be taken in eight ways on a 2D square lattice, is:
.
   +---+
       |
   X---+
.
Therefore, the total number of interactions is 1*1*8 = 8.
a(4) = 32. The four walks where one interaction occurs, each of which can be taken in eight ways on a 2D square lattice, are:
.
  +---+---+   +           +---+       +---+
          |   |               |       |   |
      X---+   +---+   X---+---+   X---+   +
                  |
              X---+
.
Therefore, the total number of interactions is 4*1*8 = 32.
a(5) = 152. Considering only walks which start with one or more steps to the right followed by an upward step there are thirty-five different walks. Eleven of these have one neighbor contact (hence A033155(5) = 11*8 = 88) while four have two contacts. These are:
.
  +---+---+   +---+---+   +---+   +---+
  |       |           |   |       |   |
  +   X---+   X---+---+   +---+   +   +
                              |       |
                          X---+   X---+
.
Therefore, the total number of contacts is (11*1 + 4*2)*8 = 152.
		

Crossrefs

Cf. A033155 (total number of n-step walks containing one neighbor contact), A038747, A047057, A173380, A174319.