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.

A006744 Number of n-step self-avoiding walks on a Manhattan lattice.

Original entry on oeis.org

1, 2, 4, 7, 13, 24, 44, 77, 139, 250, 450, 788, 1403, 2498, 4447, 7782, 13769, 24363, 43106, 75396, 132865, 234171, 412731, 721433, 1267901, 2228666, 3917654, 6843596, 12004150, 21059478, 36947904, 64506130, 112983428, 197921386, 346735329, 605046571, 1058544744, 1852200487
Offset: 1

Views

Author

Keywords

Comments

It seems that a(n) = A117633(n)/2 (the two sequences have similar names). Sequence A117633 is based on the paper by Malakis (1975). - Petros Hadjicostas, Jan 02 2019

References

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

Crossrefs

Cf. A117633.