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.
offset: 1
codomain: ℕ
Declarations
Section titled “Declarations”- A347789computable
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.