|
|
A161575
|
|
a(n) = the smallest positive integer with exactly n divisors and that, when represented in binary, contains the binary representation of n as a substring.
|
|
1
|
|
|
1, 2, 25, 8, 81, 12, 15625, 24, 36, 80, 9765625, 60, 531441, 448, 1936, 264, 152587890625, 288, 3814697265625, 336, 10816, 11264, 2384185791015625, 480, 234256, 53248, 1764, 960, 459986536544739960976801, 1008, 931322574615478515625, 1920, 295936, 1114112
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
If n is prime, then a(n) = p^(n-1) for some prime p (if a(n) exists) as all numbers with n divisors are of this form. - Chai Wah Wu, Dec 04 2014
|
|
LINKS
|
|
|
EXAMPLE
|
The positive integers with exactly 5 divisors are 16 (10000 in binary), 81 (1010001 in binary), etc. 81 is the smallest of these which contains the binary representation of 5 (101) as a substring. (Like this: {101}0001.) So a(5) = 81.
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|