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.
%I A090036 #10 Dec 31 2020 02:12:11 %S A090036 1,2,3,6,11,19,30,44,68,112,176,271,411,602,851,1232,1783,2530,3567, %T A090036 4996,6838,9279,12463,16597,21848,28227,35682,44464,54597,65966,78433, %U A090036 91725,104896,116966,126335,131998,133107,128720,119332,106335,91545,75742,60119,45840,33422,23223,15140,9094,5073,2605,1224,528,225,75,20,2 %N A090036 Number of configurations of the 5 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners. %H A090036 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/sbpnx2.txt">Solutions of small n*2 sliding block puzzles.</a> %H A090036 Takaken, <a href="http://www.ic-net.or.jp/home/takaken/nt/slide/index.html">11-Puzzle Page</a>. %H A090036 Takaken, <a href="http://www.ic-net.or.jp/home/takaken/nt/slide/result52.txt">No. 52 (9 puzzles)</a>. %e A090036 Starting from %e A090036 12345 %e A090036 6789- %e A090036 the 2 most distant configurations corresponding to a(55)=2 are %e A090036 -9371 and -5321 %e A090036 54826.....94876 %o A090036 See link in A089473. %o A090036 (Python) # alst(), moves(), swap() in A089473 %o A090036 print(alst("-123456789", (5, 2))) # _Michael S. Branicky_, Dec 30 2020 %Y A090036 Cf. A087725, A089473. Index of last sequence term: A090033. Other nonsquare sliding block puzzles: A090034, A090035, A090166, A090167. %K A090036 fini,full,nonn %O A090036 0,2 %A A090036 _Hugo Pfoertner_, Nov 27 2003