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 A360926 #15 Feb 26 2023 04:01:07 %S A360926 0,3,6,8,11,13,16,18,20,23,25,28,30,33,35,37,40,42,45,47,49,52,54,57, %T A360926 59,62,64,66,69,71,74,76,78,81,83,86,88,91,93,95,98,100,103,105,107, %U A360926 110,112,115,117,119,122,124,127,129,132,134,136,139,141,144,146 %N A360926 Smallest number of moves needed to win Integer Lunar Lander with a starting position of (n,n). %C A360926 See A360923 for the rules of Integer Lunar Lander. %C A360926 Data from _Tom Karzes_. %C A360926 The conjectured formula for A360923 implies a formula for a(n). - _N. J. A. Sloane_, Feb 26 2023 %H A360926 Rémy Sigrist, <a href="/A360926/b360926.txt">Table of n, a(n) for n = 0..300</a> %H A360926 Rémy Sigrist, <a href="/A360926/a360926.txt">C++ program</a> %e A360926 From starting position (3,3), an 8-move solution is (2,5), (1,6), (0,6), (-1,5), (-2,3), (-2,1), (-1,0), (0,0). There is no shorter solution, so a(3) = 8. %o A360926 (C++) See Links section. %Y A360926 Main diagonal of table A360923. Cf. A360924, A360925. %K A360926 nonn %O A360926 0,2 %A A360926 _Allan C. Wechsler_, Feb 25 2023 %E A360926 More terms from _Rémy Sigrist_, Feb 26 2023