Skip to content

A347789

OEIS Lean4

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: ℕ