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 A275411 #14 Jul 27 2016 10:03:46
%S A275411 15,479,5,155257,3
%N A275411 Least k such that sigma(k*n) = sigma(k*n-1), or 0 if no such k exists.
%C A275411 See also A275337.
%C A275411 From _Michael De Vlieger_, Jul 27 2016: (Start)
%C A275411 Terms 6 through 60, with 0 signifying no such k <= 10^6: {0, 195, 99107, 23, 372601, 7257, 0, 105, 1439, 1, 312646, 158, 0, 31894, 0, 65, 4213, 9, 0, 119, 10559, 717, 59677, 5607, 0, 2086, 156323, 2419, 79, 39, 0, 16378, 15947, 35, 0, 362, 0, 12154, 544409, 97, 17236, 9362, 0, 15093, 0, 717, 261103, 4347, 0, 2681, 0, 38051, 3343, 1353, 0}.
%C A275411 n such that a(n) = 0 in above data: {6, 12, 18, 20, 24, 30, 36, 40, 42, 48, 50, 54, 56, 60}, i.e., multiples of 2 and 3, and 2 and 5. (End)
%e A275411 a(2) = 479 because sigma(479*2) = sigma(479*2-1).
%t A275411 Table[k = 1; While[DivisorSigma[1, k n] != DivisorSigma[1, k n - 1], k++]; k, {n, 5}] (* _Michael De Vlieger_, Jul 27 2016 *)
%o A275411 (PARI) a(n) = {my(k = 2); while (sigma(k*n) != sigma(k*n-1), k++); k; } \\ _Michel Marcus_, Jul 27 2016
%Y A275411 Cf. A002961, A275337.
%K A275411 nonn,more
%O A275411 1,1
%A A275411 _Altug Alkan_, Jul 27 2016