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.

A090378 Number of configurations that require a minimum of n moves to be reached, starting with the empty square at mid-side of a boundary of an infinitely large extension of Sam Loyd's sliding block 15-puzzle.

Table of values

n a(n)
0 1
1 3
2 7
3 19
4 53
5 147
6 409
7 1151
8 3255
9 9241
10 26267
11 74895
12 213775
13 611463
14 1750277
15 5017901

List of values

[1, 3, 7, 19, 53, 147, 409, 1151, 3255, 9241, 26267, 74895, 213775, 611463, 1750277, 5017901]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.