A360926 Smallest number of moves needed to win Integer Lunar Lander with a starting position of (n,n).

0, 3, 6, 8, 11, 13, 16, 18, 20, 23, 25, 28, 30, 33, 35, 37, 40, 42, 45, 47, 49, 52, 54, 57, 59, 62, 64, 66, 69, 71, 74, 76, 78, 81, 83, 86, 88, 91, 93, 95, 98, 100, 103, 105, 107, 110, 112, 115, 117, 119, 122, 124, 127, 129, 132, 134, 136, 139, 141, 144, 146

Offset: 0

Author

Allan C. Wechsler, Feb 25 2023

Keywords

• nonn

Comments

See A360923 for the rules of Integer Lunar Lander.

Data from Tom Karzes.

The conjectured formula for A360923 implies a formula for a(n). - N. J. A. Sloane, Feb 26 2023

Examples

			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.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 0..300
• Rémy Sigrist, C++ program

Crossrefs

Main diagonal of table A360923. Cf. A360924, A360925.

Extensions

More terms from Rémy Sigrist, Feb 26 2023