|
|
A090335
|
|
Smallest number with exactly n distinct prime factors such that in binary representation the divisors >1 form a prefix code.
|
|
2
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Conjecture: the sequence is defined for all n.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(3) = 2093 = 7*13*23 with divisors >1: 7, 13, 23, 91, 161, 299 and 2093, which are prefix-free in binary: 111, 1101, 10111, 1011011, 10100001, 100101011 and 100000101101.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|