Let $$P(n)=\left\lfloor \sqrt{n!+{n^2(n+1)\over 2}}\right\rfloor, n\ge2$$
$\lfloor x \rfloor$ is the floor function.
Where $P_k$ and $P_j$ are two highest prime numbers such that,
$$P_j \le P(n^2-1)$$
$$P_k \le P(n^2)$$
Then we have $$P_k-nP_j=c$$ The value of $c$ is very small even the values of $P_j$ and $P_k$ are very large.
For examples:
$P(3)$ then $3\le 4$
$P(4)$ then $7\le 8$
$$7-2\times3=1\tag1$$
$P(8)$ then $199\le 201 $
$P(9)$ then $601\le 602 $
$$601-3\times 199=4\tag2$$
$P(15)$ then $1143529\le 1143535$
$P(16)$ then $4574123\le 4574143$
$$4574123-4\times1143529=7\tag3$$
Can $c$ be represent in term of a function of $n$, $$c=f(n)?$$
If not exact... can it $c\approx f(n)?$
According to PARI/GP, the first $25$ values are :
$p$ and $s$ are the necessary self-defined functions.
Some more values :