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.

A358996 Number of self-avoiding paths of length 2*(n+A002620(n-1)) along the edges of a grid with n X n square cells, which do not pass above the diagonal, start at the lower left corner and finish at the upper right corner.

Original entry on oeis.org

1, 1, 2, 2, 10, 20, 248, 1072, 31178, 270026, 18806964, 329412610, 54393195014, 1931171930256, 749416883107560, 54217060622200086
Offset: 0

Views

Author

Seiichi Manyama, Dec 09 2022

Keywords

Examples

			3 X 3 square cells
  *---*---*---E
  |   |   |   |
  *---*---*---*
  |   |   |   |
  *---*---*---*
  |   |   |   |
  S---*---*---*
a(3) = 2;
              E              E
              |              |
              *          *---*
              |          |
      *---*   *          *---*
      |   |   |              |
  S---*   *---*  S---*---*---*
		

Crossrefs

Formula

a(n) = A340043(n, A002620(n-1)).