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 A337542 #8 Aug 31 2020 10:23:24
%S A337542 0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,2,0,0,0,0,0,3,0,0,1,1,0,2,0,2,0,0,
%T A337542 0,4,0,0,0,2,0,3,0,0,2,0,0,5,0,0,0,0,0,4,0,3,0,0,0,5,0,0,2,3,0,1,0,0,
%U A337542 0,2,0,7,0,0,1,0,0,1,0,4,2,0,0,6,0,0,0,2,0,6,0,0,0,0,0,7,0,2,1,2,0,1,0,2,3
%N A337542 Number of proper divisors d of n for which sigma(A003961(d)) >= 2*sigma(d), where sigma is the sum of divisors, and A003961(x) shifts the prime factorization of x one step towards larger primes.
%C A337542 Number of terms of A337381 less than n that divide n.
%H A337542 Antti Karttunen, <a href="/A337542/b337542.txt">Table of n, a(n) for n = 1..65537</a>
%H A337542 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A337542 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A337542 a(n) = Sum_{d|n, d<n} A337383(d).
%F A337542 a(n) = A337541(n) - A337383(n).
%o A337542 (PARI)
%o A337542 A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A337542 A337542(n) = sumdiv(n,d,(d<n)&&sigma(A003961(d))>=2*sigma(d));
%Y A337542 Cf. A000203, A003961, A337381, A337383, A337541, A337543.
%Y A337542 Cf. also A337346.
%K A337542 nonn
%O A337542 1,18
%A A337542 _Antti Karttunen_, Aug 31 2020