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 A275479 #13 Mar 02 2023 16:52:55
%S A275479 1,1,2,5,1,2,1,2,3,4,1,6,1,1,6,32,1,2,1,8,1,2,1,6,3,1,3,4,1,10,1,12,1,
%T A275479 1,3,64,1,1,1,2,1,12,1,1,5,5,1,32,1,2,3,8,1,2,1,10,1,2,1,12,1,3,5,128,
%U A275479 1,4,1,4,1,8,1,12,1,3,1,8,1,10,1,32,31,2,1,6,1,1,1,14,1,6,2,4,1,1,1,12,1,1,9,80
%N A275479 Least positive k such that d(n) divides d(n+k) (d = A000005).
%C A275479 a(A057922(n)) = 1. - _Michel Marcus_, Aug 01 2016
%H A275479 Antti Karttunen, <a href="/A275479/b275479.txt">Table of n, a(n) for n = 1..20000</a>
%e A275479 a(10) = 4 because A000005(10) divides A000005(10+4).
%o A275479 (PARI) a(n) = {my(k = 1); while(numdiv(n+k) % numdiv(n) != 0, k++); k; }
%Y A275479 Cf. A000005, A057922, A171937, A275478.
%K A275479 nonn
%O A275479 1,3
%A A275479 _Altug Alkan_, Jul 29 2016
%E A275479 Data section extended up to a(100) by _Antti Karttunen_, Mar 02 2023