A162954 - OEIS

A162954

a(n) = the smallest positive integer not yet occurring in the sequence 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.

1, 2, 9, 8, 12, 18, 448, 128, 20, 36, 704, 48, 832, 1216, 720, 32768, 68, 72, 1296, 80, 1344, 1600, 900, 96, 2240, 2368, 1200, 2624, 1584, 2352, 414720, 2147483648, 132, 160, 3136, 260, 4288, 4416, 2448, 272, 4672, 5184, 2704, 6208, 3600, 4400, 640000

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Rearrangement of A162952. [From Max Alekseyev, Apr 29 2010]

LINKS

Table of n, a(n) for n=1..47.

FORMULA

a(2^n) = 2^(2^n - 1) [From Max Alekseyev, Apr 29 2010]

CROSSREFS

A162952

Sequence in context: A155909 A069815 A215025 * A357993 A129194 A300780