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 A056067 #16 May 26 2024 09:18:15
%S A056067 1,10,11,28,29,54,55,82,83,88,89,130,131,152,153,180,181,218,219,250,
%T A056067 251,278,279,304,305,310,311,338,339,372,373,378,379,406,407,416,417,
%U A056067 418,419,438,439,454,455,460,461,474,475,530,531,550,551,596,597,614
%N A056067 Numbers k such that k! is divisible by the square of (f+d)!^2 for d=0 and d=1 (and possibly larger d), where f = floor(k/2).
%C A056067 Observe that all terms (except 1) are pairs of consecutive numbers starting with an even number (e.g., 88, 89).
%C A056067 Numbers k such that A056039(k) > floor(k/2). - _Amiram Eldar_, May 24 2024
%H A056067 Amiram Eldar, <a href="/A056067/b056067.txt">Table of n, a(n) for n = 1..10000</a>
%e A056067 For n = 10 and 11, 10! and 11! are both divisible by 5!^2 and 6!^2.
%t A056067 q[n_] := Module[{k = 1}, NestWhile[#/(++k)^2 &, n!, IntegerQ]; k - 1] > Floor[n/2]; Select[Range[620], q] (* _Amiram Eldar_, May 24 2024 *)
%Y A056067 Cf. A056038, A056039, A056042, A056043, A056044.
%Y A056067 A056068 is a subsequence.
%K A056067 nonn
%O A056067 1,2
%A A056067 _Labos Elemer_, Jul 26 2000