login
A103672
Greatest m < n such that the binary representation of n! contains m!.
3
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, 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, 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
OFFSET
1,3
FORMULA
a(2^k) = 2^k - 1, a(A000079(k)) = A000225(k).
MATHEMATICA
q[n_, m_] := StringContainsQ[IntegerString[n!, 2], IntegerString[m!, 2]]; a[n_] := Module[{m = n-1}, While[!q[n, m], m--]; m]; Array[a, 104] (* Amiram Eldar, Apr 03 2025 *)
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Feb 12 2005
STATUS
approved