Amiram Eldar, <a href="/A058032/b058032_1.txt">Table of n, a(n) for n = 0..10000</a>
Amiram Eldar, <a href="/A058032/b058032_1.txt">Table of n, a(n) for n = 0..10000</a>
reviewed
approved
proposed
reviewed
editing
proposed
a(0) = 0 inserted by Amiram Eldar, Feb 08 2025
for For n = 1 and 2, when 2 and 4 is are divided by 2 gives the quotient = 1 or 2, but when they are divided by 6 qthe quotient < 1, so the largest suitable primorial is the first; thus a(1) = a(2)=1. n=11, 2^11 =2048. The largest primorial P, such that 2048/P > 1 is P=210, the 4th = A002110(4). So a(11)=4.
For n = 11, 2^11 = 2048. The largest primorial P, such that 2048/P > 1 is P = 210, the 4th = A002110(4). So a(11) = 4.
a(n) = Max{sm| qsign(floor(s)=Sign[Floor[2^n/A002110(nm)))]] = 1}.
Amiram Eldar, <a href="/A058032/b058032_1.txt">Table of n, a(n) for n = 0..10000</a>
seq[lim_] := Module[{m = -1, p = 1, primo = 1, pow = 1, s = {}}, Do[While[pow < primo, AppendTo[s, m]; pow *= 2]; p = NextPrime[p]; primo *= p; m++, {lim}]; s]; seq[20] (* Amiram Eldar, Feb 08 2025 *)