The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088862 Smallest number with exactly n prime factors (possibly with repetitions) such that in binary representation the divisors >1 form a prefix code. 2
 1, 2, 9, 125, 625, 3125, 15625, 78125, 9921875, 1260078125, 25937424601, 285311670611, 145223640340999, 21557022777501157, 799006685782884121, 15181127029874798299, 288441413567621167681, 5480386857784802185939 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = Min{k: A090330(k)=0 and A001222(k)=n}; Conjecture: the sequence is defined for all n. If a(n) = p^n, then for m > n, a(m) >= p^m. In particular, a(n) = 19^n for 13 < n < 86. - David Wasserman, Aug 24 2005 LINKS EXAMPLE a(5) = 3125 = 5^5 with divisors >1: 5, 25, 125, 625, 3125, which are prefix-free in binary: 101, 11001, 1111101, 1001110001, 110000110101. CROSSREFS Cf. A090335, A090332. Sequence in context: A194017 A135543 A316855 * A062457 A307539 A067966 Adjacent sequences:  A088859 A088860 A088861 * A088863 A088864 A088865 KEYWORD nonn AUTHOR Reinhard Zumkeller, Nov 26 2003 EXTENSIONS More terms from David Wasserman, Aug 24 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 10 05:10 EDT 2021. Contains 343748 sequences. (Running on oeis4.)