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.

A090165 Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 8 non-corner boundary squares.

This page as a plain text file.
%I A090165 #8 Jan 02 2021 14:56:54
%S A090165 1,3,6,14,32,66,134,280,585,1214,2462,4946,9861,19600,38688,76086,
%T A090165 148435,288098,554970,1062628,2016814,3800682,7093209,13127364,
%U A090165 24053454,43657576,78382622,139237375
%N A090165 Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 8 non-corner boundary squares.
%o A090165 See link in A089473.
%o A090165 (Python) # uses alst(), swap() in A089473
%o A090165 start, shape = "1-23456789ABCDEF", (4, 4)
%o A090165 print(alst(start, shape, maxd=16)) # _Michael S. Branicky_, Jan 02 2021
%Y A090165 Cf. A087725, A089473, A089484, A090164, A090378.
%K A090165 fini,more,nonn
%O A090165 0,2
%A A090165 _Hugo Pfoertner_, Nov 27 2003
%E A090165 a(17)-a(27) from _Michael S. Branicky_, Dec 28 2020