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!)
A103672 Greatest m less than n such that in binary representation n! contains m!. 2

%I #8 Mar 30 2012 18:50:49

%S 0,1,2,3,4,3,4,7,4,5,4,5,4,4,4,15,4,4,4,6,4,5,6,4,5,4,5,4,5,6,6,31,5,

%T 5,5,4,6,5,5,5,5,5,6,5,5,4,5,5,5,5,5,5,6,5,6,5,5,6,5,5,5,5,5,63,6,5,5,

%U 5,5,5,6,5,5,6,5,5,5,5,5,5,6,5,5,5,5,6,5,5,5,5,6,5,5,6,6,5,5,5,6,7,5,6,5,5

%N Greatest m less than n such that in binary representation n! contains m!.

%C a(2^k) = 2^k - 1, a(A000079(k)) = A000225(k).

%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, A103671, A036603, A007088, A000142.

%K nonn

%O 1,3

%A _Reinhard Zumkeller_, Feb 12 2005

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)