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 A069783 #18 Mar 07 2025 03:31:36
%S A069783 1,2,4,8,16,2,4,32,32,10,20,8,16,32,448,448,1792,32,64,80,3200,1280,
%T A069783 2560,320,448,1792,25088,101920,203840,128,256,4096,81920,112640,2048,
%U A069783 8960,17920,1024,2048,5120,10240,5734400,11468800,1003520,250880,8960,17920
%N A069783 a(n) = gcd(d(n!^3), d(n!)), where d() is the number of divisors function.
%H A069783 Amiram Eldar, <a href="/A069783/b069783.txt">Table of n, a(n) for n = 1..1000</a>
%F A069783 a(n) = A069780(n!).
%t A069783 Table[GCD[DivisorSigma[0, (n!)^3], DivisorSigma[0, n! ]], {n, 1, 100}]
%o A069783 (PARI) a(n) = my(e = factor(n!)[, 2]); gcd(vecprod(apply(x -> x + 1, e)), vecprod(apply(x -> 3*x + 1, e))) \\ _Amiram Eldar_, Mar 07 2025
%Y A069783 Cf. A000005, A000142, A069780, A069781, A069782.
%K A069783 easy,nonn
%O A069783 1,2
%A A069783 _Labos Elemer_, Apr 08 2002