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.

A006814 Related to self-avoiding walks on square lattice.

Original entry on oeis.org

1, 6, 21, 76, 249, 814, 2521, 7824, 23473, 70590, 207345, 610356, 1765959, 511006, 14643993, 41958852, 118976633, 337823486, 951157365, 2681163492, 7505218171, 21030311474
Offset: 1

Views

Author

Keywords

Comments

After constructing a self-avoiding walk, bridge together all adjacent neighboring sites on the walk. Then imagine a current flowing through the resulting structure. This sequence is the sum of the number of links carrying the full current across all walks of length n. - Sean A. Irvine, Aug 08 2017

References

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

Crossrefs

Extensions

a(19)-a(22) from Sean A. Irvine, Aug 08 2017

A006815 Related to self-avoiding walks on square lattice.

Original entry on oeis.org

1, 6, 23, 84, 283, 930, 2921, 9096, 27507, 82930, 244819, 722116, 2096603, 6087290, 17458887, 50090544, 142317089, 404543142
Offset: 1

Views

Author

Keywords

Comments

After constructing a self-avoiding walk, bridge together all adjacent neighboring sites on the walk. a(n) is the sum of the lengths of the shortest path in each of the resulting structures from beginning to end (i.e., using the original path and any bridges), across all walks of length n. My attempt to compute this sequence diverges from the listed terms at n=9, for which I get a(9)=27511, a(10)=82938, .... - Sean A. Irvine, Aug 09 2017

References

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

Crossrefs

Showing 1-2 of 2 results.