Skip to content

A087725

OEIS Lean4

Maximal number of moves required for the n X n generalization of the sliding block 15-puzzle (or fifteen-puzzle).

offset: 1
codomain: ℕ

The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.

low confidence