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 A325963 #7 Jun 07 2019 01:56:01
%S A325963 1,4,24,240,349440
%N A325963 Numbers n for which A034448(n)-n is equal to n-A048250(n).
%C A325963 No other terms below 536870912 (2^29).
%C A325963 a(6) > 10^12, if it exists. - _Giovanni Resta_, Jun 07 2019
%o A325963 (PARI)
%o A325963 A034448(n) = { my(f=factorint(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); };
%o A325963 A048250(n) = factorback(apply(p -> p+1,factor(n)[,1]));
%o A325963 isA325963(n) = ((A034448(n)-n) == (n-A048250(n)));
%Y A325963 Cf. A034448, A048250, A034460, A325313.
%Y A325963 Positions of zeros in A325977.
%K A325963 nonn,more
%O A325963 1,2
%A A325963 _Antti Karttunen_, Jun 04 2019