61486

Appears in sequences

• Numbers n such that S(n) = 0, where S(n) = (S(n-1) + A000040(n+1))*(-1)^n; S(0)=0, n >= 1.at n=25A131693
• Minimal number of moves for the cyclic variant of Hanoi's tower for 4 pegs and n disks, with the final peg one step away.at n=17A338024