cp's OEIS Frontend

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.

A105350 Largest squared factorial dividing n!.

This page as a plain text file.
%I A105350 #30 Oct 19 2023 17:43:10
%S A105350 1,1,1,1,4,4,36,36,576,576,518400,518400,518400,518400,25401600,
%T A105350 25401600,1625702400,1625702400,131681894400,131681894400,
%U A105350 13168189440000,13168189440000,1593350922240000,1593350922240000,229442532802560000,229442532802560000
%N A105350 Largest squared factorial dividing n!.
%C A105350 a(n) = A001044(A056039(n)) = A056038(n)^2.
%C A105350 Whenever n > 1 is not in A056067, a(n) = A180064(n). - _Andrey Zabolotskiy_, Oct 19 2023
%H A105350 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>.
%t A105350 a[n_] := (For[k = 1, Divisible[n!, k!^2], k++]; (k-1)!^2)
%t A105350 Table[a[n], {n, 0, 24}] (* _Jean-François Alcover_, Aug 07 2018 *)
%Y A105350 Cf. A000142, A000290, A055071, A055772, A056067.
%Y A105350 Cf. A180064.
%K A105350 nonn
%O A105350 0,5
%A A105350 _Reinhard Zumkeller_, Apr 01 2005
%E A105350 Data and offset corrected by _Jean-François Alcover_, Aug 07 2018
%E A105350 Edited by _Andrey Zabolotskiy_, Oct 18 2023