a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks.

A347789

a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks.

Terms

    a(0) =0a(1) =2a(2) =4a(3) =8a(4) =12a(5) =20a(6) =28a(7) =44a(8) =60a(9) =92a(10) =124a(11) =188a(12) =252a(13) =380a(14) =508a(15) =764a(16) =1020a(17) =1532a(18) =2044a(19) =3068a(20) =4092a(21) =6140a(22) =8188a(23) =12284a(24) =16380a(25) =24572a(26) =32764a(27) =49148a(28) =65532a(29) =98300

External references