|
%I #10 Apr 07 2013 10:36:28
%S 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,
%T 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,
%U 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
%N Smallest m such that in binary representation n! doesn't contain m!.
%C 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
%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%Y Cf. A102730, A103672, A036603, A007088, A000142.
%K nonn
%O 6,1
%A _Reinhard Zumkeller_, Feb 12 2005
|
