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 A378914 #11 Dec 12 2024 15:12:48
%S A378914 2,2,3,2,2,3,2,2,3,2,2,4,2,2,3,2,2,3,2,2,3,2,2,4,2,2,3,2,2,3,2,2,3,2,
%T A378914 2,4,2,2,3,2,2,3,2,2,3,2,2,4,2,2,3,2,2,3,2,2,3,2,2,4,2,2,3,2,2,3,2,2,
%U A378914 3,2,2,4,2,2,3,2,2,3,2,2,3,2,2,7,2,2,3,2,2,3
%N A378914 Smallest positive m such that sigma(m) does not divide n, where sigma is the sum-of-divisors function (A000203).
%H A378914 Paolo Xausa, <a href="/A378914/b378914.txt">Table of n, a(n) for n = 1..10000</a>
%H A378914 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%t A378914 A378914[n_] := Module[{m = 1}, While[Divisible[n, DivisorSigma[1,++m]]]; m];
%t A378914 Array[A378914, 100]
%o A378914 (PARI) a(n) = my(m=1); while (!(n % sigma(m)), m++); m; \\ _Michel Marcus_, Dec 11 2024
%Y A378914 Cf. A000203, A051549, A378912.
%K A378914 nonn,easy
%O A378914 1,1
%A A378914 _Paolo Xausa_, Dec 11 2024