262152

Appears in sequences

• Sums of 2 distinct powers of 8.at n=16A038484
• Sums of two powers of 8.at n=22A055259
• a(n) is the closest number to 2^n which is divisible by n.at n=17A082894
• Number of ways of 4-coloring a map in which there is a central circle surrounded by an annulus divided into n-1 regions. There are n regions in all.at n=13A090860
• Elements of A103741 that do not terminate in a zero digit.at n=18A103764
• a(n) = n_{2^n}.at n=17A122624
• A106486-encodings for the minimal representatives of each equivalence class of the finite combinatorial games.at n=46A126011
• a(n) = smallest multiple of n which is >= 2^n.at n=17A128093
• a(n) = n^6 + n.at n=8A131472
• Semi-sums (means) of a Fermat prime and a Mersenne prime.at n=32A174057
• a(n) = 8*(2^n + 1).at n=15A175161
• Numbers of the form m = 2^i + 2^j, where i > j >= 0, such that m - 1 is prime.at n=46A239708
• a(n) = 2^n + 8.at n=18A242475
• Square array A(n, k), n, k >= 0, read and filled by upwards antidiagonals the greedy way with distinct nonnegative integers such that the binary expansions of any two distinct terms in the same row or column or antidiagonal have no common 1's.at n=48A366031