login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090335 Smallest number with exactly n distinct prime factors such that in binary representation the divisors >1 form a prefix code. 2
1, 2, 33, 2093, 239723, 29918977, 17597346187, 17155385292853, 10633323942990239, 15790705299133143889 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Conjecture: the sequence is defined for all n.
a(10) <= 281594003343201014885689. - David Wasserman, Dec 13 2005
LINKS
FORMULA
a(n) = Min{k: A090330(k)=0 and A001221(k)=n}.
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
Sequence in context: A242621 A206385 A263052 * A302452 A113105 A132567
KEYWORD
nonn,base,more
AUTHOR
Reinhard Zumkeller, Nov 26 2003
EXTENSIONS
More terms from David Wasserman, Dec 13 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 16 12:51 EDT 2024. Contains 374349 sequences. (Running on oeis4.)