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 A355941 #8 Jul 22 2022 16:45:30
%S A355941 1,6,14,15,24,35,42,56,105,168,210,286,376,470,552,637,672,715,840,
%T A355941 858,874,969,1144,1274,1288,1410,1848,1880,2001,2002,2145,2185,2261,
%U A355941 2622,3021,3185,3290,3296,3375,3432,3496,3822,4290,4669,4830,4968,5005,5096,5640,6118,6291,6555,6783,7049,7776,8008,9555,9888
%N A355941 Numbers k such that A003973(k) is a multiple of A000203(k).
%C A355941 If both x and y are terms and gcd(x, y) = 1, then x*y is a term also.
%H A355941 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A355941 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%t A355941 f[p_, e_] := ((q = NextPrime[p])^(e + 1) - 1)/(q - 1); Select[Range[10^4], # == 1 || Divisible[Times @@ f @@@ FactorInteger[#], DivisorSigma[1, #]] &] (* _Amiram Eldar_, Jul 22 2022 *)
%o A355941 (PARI)
%o A355941 A003973(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); sigma(factorback(f)); };
%o A355941 A355940(n) = !(A003973(n)%sigma(n));
%o A355941 isA355941(n) = A355940(n);
%Y A355941 Cf. A000203, A003973.
%Y A355941 Positions of 1's in A355934, and also in A355940 (characteristic function).
%K A355941 nonn
%O A355941 1,2
%A A355941 _Antti Karttunen_, Jul 22 2022