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 A060738 #17 Jun 15 2024 05:49:36
%S A060738 0,0,0,0,0,0,0,0,3,4,5,12,51,92,225,340,573,1325,2334,6024,8724,13130,
%T A060738 21601,46169,67213,106427,178014,242104,338499,727248,988029,1924615,
%U A060738 2426894,3592164,5817845,8360196,10396523,21941765,33649653,48804040,61413482,124029358
%N A060738 Number of distinct differences between consecutive divisors (ordered by increasing magnitude) of n! which are not also divisors of n!.
%F A060738 a(n) = A060763(n!).
%e A060738 For n up to 7 all divisor differences of n! are also divisors of n!.
%e A060738 For n = 8, there are 3 divisor differences of 8! = 40320 which are not divisors of 8!, namely 27, 54 and 108.
%t A060738 a[n_ ] := Length[Complement[Drop[d=Divisors[n! ], 1]-Drop[d, -1], d]]
%o A060738 (PARI) a(n) = {my(v = List(), f = n!, d1 = 1, del); fordiv(f, d, if(d > 1, del = d - d1; if(f % del, listput(v, del)); d1 = d)); #Set(v);} \\ _Amiram Eldar_, Jun 15 2024
%Y A060738 Cf. A000142, A027423, A060737, A060742, A060763.
%K A060738 nonn
%O A060738 0,9
%A A060738 _Labos Elemer_, Apr 25 2001
%E A060738 Edited by _Dean Hickerson_, Jan 22 2002
%E A060738 More terms from _Sean A. Irvine_, Dec 21 2022
%E A060738 a(41) from _Amiram Eldar_, Jun 15 2024