Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg one step away.
A005665
Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg one step away.
Terms
- a(0) =0a(1) =1a(2) =5a(3) =15a(4) =43a(5) =119a(6) =327a(7) =895a(8) =2447a(9) =6687a(10) =18271a(11) =49919a(12) =136383a(13) =372607a(14) =1017983a(15) =2781183a(16) =7598335a(17) =20759039a(18) =56714751a(19) =154947583a(20) =423324671a(21) =1156544511a(22) =3159738367a(23) =8632565759a(24) =23584608255a(25) =64434348031a(26) =176037912575a(27) =480944521215
External references
- oeis: A005665