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 A351443 #13 Feb 12 2022 14:17:18
%S A351443 1,49,40905,106353,140211,275301,302697,499041,597213,1094913,1284417,
%T A351443 1578933,2004345,2266137,2560653,3247857,3444201,3738717,4425921,
%U A351443 5014953,5123817,5211297,5407641,5505813,5996673,6193017,6870339,7174737,8156457,8941833,9432693,9825381,9923553
%N A351443 Odd numbers k for which A003958(sigma(k)) = A003958(k), where A003958 is multiplicative with a(p^e) = (p-1)^e and sigma is the sum of divisors function.
%C A351443 Odd numbers k for which A351442(k) = A003958(k), or equally, for which k = A351444(k) = A322582(k) + A351442(k).
%C A351443 The 13th term, 2004345, is one of the rare abundant numbers (A005101, A005231) in this sequence.
%H A351443 <a href="/index/O#opnseqs">Index entries for sequences where odd perfect numbers must occur, if they exist at all</a>
%H A351443 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A351443 (PARI)
%o A351443 A003958(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]--); factorback(f); };
%o A351443 A351442(n) = A003958(sigma(n));
%o A351443 isA351443(n) = ((n%2) && (A351442(n)==A003958(n)));
%Y A351443 Odd terms in A351446.
%Y A351443 Cf. A000203, A003958, A005101, A005231, A322582, A351442, A351444, A351445.
%Y A351443 These terms doubled form a subsequence of A351447.
%K A351443 nonn
%O A351443 1,2
%A A351443 _Antti Karttunen_, Feb 12 2022