16783361

Appears in sequences

• a(n) = 4^(n+1) + 3*2^n + 1.at n=12A036562
• 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=22A173281
• Number of pieces after a sheet of paper is folded n times and cut diagonally.at n=25A257418
• a(0)=3; for n > 0, a(n) = 2^(2*n) + 3*2^(n-1) + 1.at n=12A343176