524297

Appears in sequences

• a(n) = n_{2^n}.at n=18A122624
• Let a(1) = 1. Given a(1), ..., a(2^t), find the least k such that a(1) + 2^k, a(2) + 2^k, ..., a(2^t) + 2^k are all composite and a(1) + 2^k > a(2^t). Then a(2^t+i) = a(i) + 2^k for all 1 <= i <= 2^t.at n=9A173281
• a(n) = 2^n + 9.at n=19A188165
• Number of ways to choose a constant partition of each part of a constant partition of n.at n=38A279789
• Bitmaps of king + rook vs. king checkmate patterns on a standard 8 X 8 board.at n=25A362950