cp's OEIS Frontend

A183118 Magnetic Tower of Hanoi, total number of moves, optimally solving the [NEUTRAL ; NEUTRAL ; NEUTRAL] pre-colored puzzle.

%I A183118 #21 Jan 28 2019 08:10:05
%S A183118 0,1,4,11,30,83,236,687,2026,6023,17984,53819,161254,483451,1449876,
%T A183118 4348903,13045602,39135119,117402792,352204467,1056607454
%N A183118 Magnetic Tower of Hanoi, total number of moves, optimally solving the [NEUTRAL ; NEUTRAL ; NEUTRAL] pre-colored puzzle.
%C A183118 A.   The Magnetic Tower of Hanoi puzzle is described in link 1 listed below. The Magnetic Tower is pre-colored. Pre-coloring is [NEUTRAL ; NEUTRAL ; NEUTRAL], given in [Source ; Intermediate ; Destination] order. Thus, the tower in this case is "natural" or "free". The solution algorithm producing the sequence is optimal (the sequence presented gives the minimum number of moves to solve the "free" Magnetic Tower of Hanoi puzzle). Optimal solutions are discussed and their optimality is proved in link 2 listed below.
%C A183118 B.   Number of moves to solve the given puzzle, for large N, is close to 0.5*(20/33)*3^N ~ 0.5*0.606*3^(N). Series designation: S606(N).
%C A183118 C.   The large N ratio of number of moves to solve the [NEUTRAL ; NEUTRAL ; NEUTRAL] puzzle to the number of moves to solve the [RED ; BLUE ; BLUE] or [RED ; RED ; BLUE] puzzle is 20/33 or about 60.6% (see link 2).
%D A183118 "The Magnetic Tower of Hanoi", Uri Levy, Journal of Recreational Mathematics, Volume 35 Number 3 (2006), 2010, pp 173.
%H A183118 Uri Levy, <a href="http://arxiv.org/abs/1003.0225">The Magnetic Tower of Hanoi</a>, arXiv:1003.0225 [math.CO], 2010.
%H A183118 Uri Levy, <a href="http://arxiv.org/abs/1011.3843">Magnetic Towers of Hanoi and their Optimal Solutions</a>, arXiv:1011.3843 [math.CO], 2010.
%H A183118 Web applet, <a href="http://www.weizmann.ac.il/zemed/davidson_online/mtoh/MTOHeng.html">to play The Magnetic Tower of Hanoi</a>
%H A183118 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (4,-2,-2,-5,6).
%F A183118 G.f. x*(-2*x^4-4*x^3-3*x^2+1)/(-6*x^5+5*x^4+2*x^3+2*x^2-4*x+1).
%F A183118 Recurrence Relations (a(n)=S606(n) as in referenced paper):
%F A183118 S606(n) = S636(n-1)+ S636(n-2)+ S909(n-2)+ 3^(n-2)+ 2; n >= 2; S909(0)  = 0; S636(0)  = 0
%F A183118 Note: S636(n) and S909(n) are sequences A183116 and A183112 respectively.
%F A183118 Closed-Form Expression: Let
%F A183118 λ1 = [1+sqrt(26/27)]^(1/3) + [1-sqrt(26/27)]^(1/3)
%F A183118 λ2 = -0.5*λ1 + 0.5*i*{[sqrt(27)+sqrt(26)]^(1/3)- [sqrt(27)-sqrt(26)]^(1/3)}
%F A183118 λ3 = -0.5*λ1 - 0.5*i*{[sqrt(27)+sqrt(26)]^(1/3)- [sqrt(27)-sqrt(26)]^(1/3)}
%F A183118 AS = [(7/11)* λ2* λ3 - (10/11)*(λ2 + λ3) + (19/11)]/[(λ2 - λ1)*( λ3 - λ1)]
%F A183118 BS = [(7/11)* λ1* λ3 - (10/11)*(λ1 + λ3) + (19/11)]/[(λ1 - λ2)*( λ3 - λ2)]
%F A183118 CS = [(7/11)* λ1* λ2 - (10/11)*(λ1 + λ2) + (19/11)]/[(λ2 - λ3)*( λ1 - λ3)]
%F A183118 Then, for n > 0:
%F A183118 S606(n) = (10/33)*3^n + 0.5*AS*[(λ1 + 1)^2]*λ1^(n-1) + 0.5*BS*[(λ2 + 1)^2]*λ2^(n-1) + 0.5*CS*[(λ3 + 1)^2]*λ3^(n-1) - 2
%t A183118 Join[{0}, LinearRecurrence[{4, -2, -2, -5, 6}, {1, 4, 11, 30, 83}, 20]] (* _Jean-François Alcover_, Jan 28 2019 *)
%Y A183118 A183117 is an "original" sequence describing the number of moves of disk number k, optimally solving the pre-colored puzzle at hand. The integer sequence listed above is the partial sums of the A183117 original sequence.
%Y A183118 A003462 "Partial sums of A000244" is the sequence (also) describing the total number of moves solving [RED ; BLUE ; BLUE] or [RED ; RED ; BLUE] pre-colored Magnetic Tower of Hanoi puzzle.
%Y A183118 A183111 through A183125 are related sequences, all associated with various solutions of the pre-coloring variations of the Magnetic Tower of Hanoi.
%K A183118 nonn
%O A183118 0,3
%A A183118 _Uri Levy_, Jan 01 2011