2147484672

Appears in sequences

• a(1)=1. a(n) = the smallest integer >a(n-1) such that both a(n) and the number of divisors of a(n) contain the same number of 1's in their binary representations as n has when written in binary.at n=23A162955
• Half the number of nX1 0..2 arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.at n=31A183494
• a(n) = n^2 + 2^(n-1).at n=31A362438