%I #7 Mar 08 2025 11:04:54

%S 1,1,2,5,3,6,11,7,10,17,11,16,25,15,22

%N Number of moves required to reach a position with the maximum number of heads in the game of blet with 2*n coins.

%C See A075273 or Rodriguez Villegas, Sadun, and Voloch (2002) for the definition of blet.

%C Rodriguez Villegas, Sadun, and Voloch (2002) prove that the maximum number of heads achievable is A047206(n).

%H Fernando Rodriguez Villegas, Lorenzo Sadun, and José Felipe Voloch, <a href="https://doi.org/10.1080/00029890.2002.11919904">Blet: a mathematical puzzle</a>, The American Mathematical Monthly 109 (2002), Issue 8, 729-740.

%e For n = 5, a(5) = 5 moves are needed to go from HTHTHTHTHT to a sequence with the maximum number A047206(5) = 8 of heads: HTHTHTHTHT -> THHTHTHTHH -> THHTHTTHTH -> THHHTHTHTH -> THHHHTHHTH -> HHHHHTHHHT.

%Y Cf. A047206, A075273, A381813, A381814.

%K nonn,more,new

%O 2,3

%A _Pontus von Brömssen_, Mar 08 2025