Simplify first by substitution:
$$t=nu$$
$$I(n)=n\int_0^{\infty}\left((u+1)\ln\left(1+\frac{1}{u}\right)-\ln\left((u+1)\ln\left(1+\frac{1}{u}\right)\right)-1\right)du$$
So we need to find the following constant:
$$I_1=\int_0^{\infty}\left((u+1)\ln\left(1+\frac{1}{u}\right)-\ln\left((u+1)\ln\left(1+\frac{1}{u}\right)\right)-1\right)du$$
Frankly, this looks bad, I doubt there's an exact solution. The numerical value, as stated by MathIsFun7225 is about $0.3803301$.
Using some substitutions, we can transform the integral to:
$$I_1=\int_0^{\infty}\left(\frac{s}{e^s-1}+\ln(e^s-1)-\ln s-1\right)\frac{e^s ds}{(e^s-1)^2}$$
The function:
$$f(s)=s+(e^s-1)\left(\ln(e^s-1)-\ln s-1\right)$$
Has a nice Taylor expansion around zero:
$$f(s)= \frac{s^3}{8}+\frac{s^4}{16}+\frac{11s^5}{576}+\frac{5s^6}{1152}+\frac{41s^7}{51840}+\frac{5s^8}{41472}+\dots \tag{1}$$
$$I_1= \int_0^{\infty}f(s)\frac{e^s ds}{(e^s-1)^3} \tag{2}$$
Consider:
$$J_k=\int_0^{\infty}\frac{s^k e^s ds}{(e^s-1)^3}$$
In the answer(s) to this question: An integral for the difference of zeta functions $\zeta (s-1)-\zeta(s)$ it is shown that:
$$J_k=\frac{k!}{2} (\zeta(k-1)-\zeta(k)) \tag{3}$$
Finally, summing a few first terms of the series (1), we obtain a number close to numerical value of the integral.
For example three first terms give us the value $0.3079 \ldots$.
The first six terms give $0.3668 \dots$.
However, since the Taylor series (1) has a finite radius of convergence, the series obtained for the integral is asymptotic in nature and most likely diverges. But as usual with asymptotic series, finitely many terms should give a good approximation for the integral.
The series terms all have the same sign up to $s^{20}$, then we encounter the first sign change. Summing all the terms for $k=3, \dots, 20$, we obtain:
$$I_1 \approx 0.3803246 \dots$$
Which is a good approximation. I'm not sure what number of terms will give the best agreement with the exact value.
Update:
Using @automaticallyGenerated's answer, I have checked the asymptotic series numerically, and here's the result for different number of terms (starting with $k=3$:
$$\left(
\begin{array}{cc}
15 & 0.380130074058105238689754781268 \\
16 & 0.380223929458113985169381973291 \\
17 & 0.380272711854003260001162359969 \\
18 & 0.380298890136158789781977313273 \\
19 & 0.380315792727508660246473419445 \\
20 & 0.380324694728276221658188520931 \\
21 & 0.380323061796211720843375783973 \\
22 & 0.380322359261040332671841945024 \\
23 & 0.380338844375899979977446596772 \\
24 & 0.380347115006252429034820349587 \\
25 & 0.380297504104854694212803005034 \\
26 & 0.380272706474517002755450053827 \\
27 & 0.380464567324088204449788570410 \\
28 & 0.380560498418357337146304250784 \\
29 & 0.379700469605659832230621914362 \\
30 & 0.379270457893190348577342716132 \\
31 & 0.383724367550841791140185335387 \\
32 & 0.385951317329242809053234753014 \\
33 & 0.359568287367679813690910184314 \\
34 & 0.346376786006546776686420830652 \\
35 & 0.523655288520764751498176067439 \\
36 & 0.612294499198448476853004251809 \\
37 & -0.72901761727886247456922591902 \\
38 & -1.39967353904013645644838768421 \\
39 & 9.9527821590780141647092153950 \\
40 & 15.6290094947770368344784462912 \\
41 & -91.221244446733759055679027656 \\
42 & -144.646369270054172239030454206 \\
43 & 967.80090283422936072262158677 \\
44 & 1524.02452894976299543567171838 \\
45 & -11226.0112127462193171191333164 \\
\end{array}
\right)$$
Clearly, the series doesn't converge and the best approximation is achieved around $k_m=20$.