4294967301domain: NAppears in sequencesa(n) = 2^(2^n) + 5.at n=5A063486Numbers a(n) which are the minimum number of moves needed in a variation of the tower of Hanoi with 4 towers and n disks.at n=33A248604