Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.
A007664
Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.
Terms
- a(0) =0a(1) =1a(2) =3a(3) =5a(4) =9a(5) =13a(6) =17a(7) =25a(8) =33a(9) =41a(10) =49a(11) =65a(12) =81a(13) =97a(14) =113a(15) =129a(16) =161a(17) =193a(18) =225a(19) =257a(20) =289a(21) =321a(22) =385a(23) =449a(24) =513a(25) =577a(26) =641a(27) =705a(28) =769a(29) =897
External references
- oeis: A007664