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 A360118 #16 Feb 21 2023 11:43:38
%S A360118 0,0,1,0,1,0,1,0,2,1,1,0,1,1,3,0,1,0,1,0,3,1,1,0,2,1,3,1,1,1,1,0,3,1,
%T A360118 3,0,1,1,3,1,1,0,1,1,5,1,1,0,2,2,3,1,1,0,3,2,3,1,1,0,1,1,5,0,3,1,1,1,
%U A360118 3,4,1,0,1,1,5,1,3,1,1,2,4,1,1,1,3,1,3,1,1,1,3,1,3,1,3,0,1,2,5,0,1,1,1,1,7
%N A360118 Number of differences (not all necessarily distinct) between consecutive divisors of n which are not also divisors of n.
%H A360118 Antti Karttunen, <a href="/A360118/b360118.txt">Table of n, a(n) for n = 1..65537</a>
%F A360118 For all n >= 1, A060763(n) <= a(n) < A060764(n).
%F A360118 a(n) = A060764(n) - A360119(n).
%e A360118 For n=70, its divisors are {1, 2, 5, 7, 10, 14, 35, 70} and their first differences are {1, 3, 2, 3, 4, 21, 35}, of which the differences {3, 3, 4, 21} are not divisors, so a(70) = 4. Note that in contrast to A060763, here the difference 3 is counted twice because there are two copies of it among the differences.
%o A360118 (PARI) A360118(n) = { my(d=divisors(n), erot = vector(#d-1, k, d[k+1] - d[k])); sum(i=1,#erot,!!(n%erot[i])); };
%Y A360118 Cf. also A060763, A060764, A138652, A360119.
%K A360118 nonn
%O A360118 1,9
%A A360118 _Antti Karttunen_, Feb 20 2023