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.

A323561 Number of rooted self-avoiding king's walks of n moves on an infinite chessboard with first move specified.

Original entry on oeis.org

2, 14, 92, 584, 3644, 22482, 137626, 837466, 5072590, 30611376, 184171252, 1105262004, 6618842522, 39564403462, 236123357538, 1407249202976, 8376673823516
Offset: 1

Views

Author

Hugo Pfoertner, Jan 17 2019

Keywords

Comments

The first move is either (0,0) -> (1,0) or (0,0) -> (1,1). Rotated paths are not counted separately.

Crossrefs