This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A374851 #4 Aug 17 2024 23:09:57
%S A374851 4,25,294,5184,169000,6350400,331218944,18517766400,1288408000000,
%T A374851 124147372916736,12047030383804416,1481741383824000000,
%U A374851 199987846858565222400,26836516406718627840000,3937581724026934119628800,668393794316928024576000000,130212266115912538521600000000,25085181032622344612780605440000
%N A374851 Obverse convolution A000040**A000040; see Comments.
%C A374851 See A374848 for the definition of obverse convolution and a guide to related sequences. a(2k+1) is a square for k>=0. Conjecture: every positive integer divides a(n) for infinitely many n.
%t A374851 s[n_] := Prime[n]; t[n_] := Prime[n];
%t A374851 u[n_] := Product[s[k] + t[n + 1 - k], {k, 1, n}]
%t A374851 Table[u[n], {n, 1, 18}]
%Y A374851 Cf. A000040, A374848.
%K A374851 nonn
%O A374851 1,1
%A A374851 _Clark Kimberling_, Aug 05 2024