Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.

A060590

Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.

Terms

    a(0) =0a(1) =2a(2) =2a(3) =14a(4) =10a(5) =62a(6) =42a(7) =254a(8) =170a(9) =1022a(10) =682a(11) =4094a(12) =2730a(13) =16382a(14) =10922a(15) =65534a(16) =43690a(17) =262142a(18) =174762a(19) =1048574a(20) =699050a(21) =4194302a(22) =2796202a(23) =16777214a(24) =11184810a(25) =67108862a(26) =44739242a(27) =268435454a(28) =178956970a(29) =1073741822

External references