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 A360925 #17 Feb 26 2023 08:43:18 %S A360925 0,1,4,7,9,12,14,17,19,21,24,26,29,31,34,36,38,41,43,46,48,50,53,55, %T A360925 58,60,63,65,67,70,72,75,77,79,82,84,87,89,92,94,96,99,101,104,106, %U A360925 108,111,113,116,118,120,123,125,128,130,133,135,137,140,142,145 %N A360925 Smallest number of moves needed to win Integer Lunar Lander from starting position (n,0). %C A360925 See A360923 for game rules. %C A360925 Data from _Tom Karzes_. %C A360925 The first differences begin 1, 3, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, ... Are all the differences after the start either 2 or 3? - _N. J. A. Sloane_, Feb 25 2023 %C A360925 Conjecture: For n >= 2, a(n) = n+1+floor(sqrt(2*n^2-2*n-3)). - _N. J. A. Sloane_, Feb 26 2023 %H A360925 Rémy Sigrist, <a href="/A360925/b360925.txt">Table of n, a(n) for n = 0..250</a> %H A360925 Rémy Sigrist, <a href="/A360925/a360925.txt">C++ program</a> %e A360925 For starting position (3,0), a 7-move solution is (2,2), (1,3), (0,3), (-1,2), (-1,1), (-1,0), (0,0). There are no shorter solutions, so a(3) = 7. %o A360925 (C++) See Links section. %Y A360925 First column of table A360923. %Y A360925 Cf. A360924, A360926. %K A360925 nonn %O A360925 0,3 %A A360925 _Allan C. Wechsler_, Feb 25 2023 %E A360925 More terms from _Rémy Sigrist_, Feb 26 2023