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 A342922 #21 Feb 25 2022 11:38:06
%S A342922 6,28,29,496,857,1721,8128,164284,6511664,33550336,400902412,
%T A342922 8589869056
%N A342922 Numbers k such that A342925(k) = k + 2*A003415(k).
%C A342922 Question: Are all odd terms in A001359?
%C A342922 Certainly any prime p such that A003415(p+1) = p + 2 satisfies the equation. See comments in A007850.
%H A342922 <a href="/index/O#opnseqs">Index entries for sequences where odd perfect numbers must occur, if they exist at all</a>
%t A342922 Select[Range[2*10^5], #3 == #1 + 2 #2 & @@ Prepend[Map[If[# < 2, 0, # Total[#2/#1 & @@@ FactorInteger[#]]] &, {#, DivisorSigma[1, #]}], #] &] (* _Michael De Vlieger_, Feb 25 2022 *)
%o A342922 (PARI)
%o A342922 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A342922 A342925(n) = A003415(sigma(n));
%o A342922 isA342922(n) = (A342925(n)==(n+(2*A003415(n))));
%Y A342922 Cf. A000396 (subsequence), A001359, A003415, A007850.
%Y A342922 Cf. A203617, A342923, A342924, A342925.
%K A342922 nonn,more
%O A342922 1,1
%A A342922 _Antti Karttunen_, Apr 07 2021
%E A342922 Terms a(11) and a(12) from _Antti Karttunen_, Feb 25 2022