"It would be highly desirable to obtain a closed form"
This motivated me to look into this.
I have a method which was successful in many cases when I search for an underlying formula in a Hankel transform based sequence.
The first step is to find the Stieltjes continued fraction expansion of (n!)^2.
With help of PARI I see here:
1/(1-x/(1-3*x/(1-(20/3)*x/(..)))
1, 3, 20/3, 164/15, 3537/205, 127845/5371, ...
The next step is to multiply these numbers in pairs and take the denominators of the resulting fractions. If these are all square numbers it means you are with
this method on the right track and should look on the square roots of these.
Indeed we see square numbers (be careful not far checked yet!). We take the roots.
This gives us the mystery sequence:
1, 1, 3, 5, 41, 131, 947, 6197, 116499, 1622749, 78523849, ...
The next step is finding a recursion that defines this sequence.
This can be a surprising and nonlinear thing like for example Somos sequences
but also something completely different ...
Maybe you have ideas how to find such recurrences here ?
Here at this point I decided to ask this list as I can imagine to learn new methods this way, may search for some recurrence was not yet successful with some limited effort yet.
Finally the expectation would be that the numbers in A165343 can be factored
with help of the terms from this sequence.
This seems to be indeed the case:
1, 3, 656, 58910976,
we see the factors
3; 2, 41; 2,3,947; ....
but there are also sometime others, this is unfortunately a red flag and not a good sign for this method of formula guessing ...
I wish all here a happy and successful 2026
All the best
Thomas