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 A349866 #10 Dec 03 2021 20:09:36
%S A349866 4,45,6048,14421,26409026,29270772,30685402
%N A349866 Fixed points of A318996.
%C A349866 Integers m such that Sum_{d|m} (sigma(m) mod d) = m.
%H A349866 Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_1065.htm">Puzzle 1065. A larger integer than 45 such that ...</a>, The Prime Puzzles and Problems Connection.
%e A349866 The sum of divisors of 4 is 7 with divisors 1, 2, 4; And (7 mod 1) + (7 mod 2) + (7 mod 4) = 0 + 1 + 3 = 4.
%o A349866 (PARI) isok(m) = my(sn = sigma(m)); sumdiv(m, d, sn % d) == m;
%o A349866 (Python)
%o A349866 from itertools import count, islice
%o A349866 from sympy import divisor_sigma, divisors
%o A349866 def A349866gen(): # generator of terms
%o A349866 return filter(lambda m: sum(divisor_sigma(m) % d for d in divisors(m,generator=True)) == m, count(1))
%o A349866 A349866_list = list(islice(A349866gen(),4)) # _Chai Wah Wu_, Dec 03 2021
%Y A349866 Cf. A000203, A318996.
%K A349866 nonn,more
%O A349866 1,1
%A A349866 _Michel Marcus_, Dec 03 2021