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!)
 A103671 Smallest m such that in binary representation n! doesn't contain m!. 2
 4, 5, 5, 5, 6, 5, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 5, 6, 5, 6, 5, 6, 5, 5, 5, 6, 6, 6, 5, 7, 6, 6, 6, 6, 6, 7, 6, 6, 5, 6, 6, 6, 6, 6, 6, 5, 6, 7, 6, 6, 5, 6, 6, 6, 6, 6, 6, 5, 6, 6, 6, 6, 6, 7, 6, 6, 7, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 7, 6, 6, 6, 6, 7, 6, 6, 7, 7, 6, 6, 6, 7, 6, 6, 7, 6, 6, 6, 7, 6, 7, 6, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 6,1 COMMENTS Reinhard Zumkeller conjectures (at A102730) that this sequence is bounded. I conjecture the contrary, that for every k there is n with a(n) > k. - Charles R Greathouse IV, Apr 07 2013 LINKS CROSSREFS Cf. A102730, A103672, A036603, A007088, A000142. Sequence in context: A117768 A018245 A264936 * A144192 A029909 A141276 Adjacent sequences:  A103668 A103669 A103670 * A103672 A103673 A103674 KEYWORD nonn AUTHOR Reinhard Zumkeller, Feb 12 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 October 27 15:27 EDT 2020. Contains 338035 sequences. (Running on oeis4.)