Minimum number of moves to solve a variant of the first Panex puzzle of order n of transferring a side tower to the center column.
A115185
Minimum number of moves to solve a variant of the first Panex puzzle of order n of transferring a side tower to the center column.
Terms
- a(0) =1a(1) =2a(2) =9a(3) =23a(4) =58a(5) =142a(6) =345a(7) =835a(8) =2018a(9) =4874a(10) =11769a(11) =28415a(12) =68602a(13) =165622a(14) =399849a(15) =965323a(16) =2330498a(17) =5626322a(18) =13583145a(19) =32792618a(20) =79168378a(21) =191129374a(22) =461427129a(23) =1113983635a(24) =2689394402a(25) =6492772442a(26) =15674939289a(27) =37842651023a(28) =91360241338
External references
- oeis: A115185