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 A324201 #28 Oct 22 2024 05:43:04 %S A324201 9,125,161051,410338673,925103102315013629321, %T A324201 1271991467017507741703714391419,49593099428404263766544428188098203, %U A324201 165163983801975082169196428118414326197216835208154294976154161023 %N A324201 a(n) = A062457(A000043(n)) = prime(A000043(n))^A000043(n), where A000043 gives the exponent of the n-th Mersenne prime. %C A324201 If there are no odd perfect numbers, then the terms give all solutions n > 1 to A323244(n) = 0. %C A324201 Conversely, if these are all numbers k > 1 that satisfy A323244(k) = 0 (which can be proved if one can show, for example, that no number in A007916 can satisfy the equation), then no odd perfect numbers exist. See also A336700. - _Antti Karttunen_, Jan 12 2024 %H A324201 Amiram Eldar, <a href="/A324201/b324201.txt">Table of n, a(n) for n = 1..12</a> %F A324201 a(n) = A062457(A000043(n)). %F A324201 A323244(a(n)) = 0. %F A324201 a(n) = A005940(1+A000396(n)). [Provided no odd perfect numbers exist] %t A324201 Prime[#]^#&/@MersennePrimeExponent[Range[8]] (* _Harvey P. Dale_, Mar 15 2024 *) %Y A324201 Cf. A000043, A000396, A005940, A007916, A062457, A323244, A324200. %Y A324201 Subsequence of A001597. %Y A324201 Cf. also A336700, A368989. %K A324201 nonn %O A324201 1,1 %A A324201 _Antti Karttunen_, Feb 18 2019