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 A284594 #42 Feb 16 2025 08:33:43 %S A284594 2,6,29,36,2480,14881 %N A284594 Numbers whose square has a prime number of partitions. %C A284594 Because asymptotically A072213(n) = A000041(n^2) ~ exp(Pi*sqrt(2/3)*n) / (4*sqrt(3)*n^2), the sum of the prime probabilities ~ 1/log(A072213(n)) is diverging and there are no obvious restrictions on primality; therefore, this sequence may be conjectured to be infinite. %C A284594 Curiously, both A000041(6^2) and A000041(6^4) are prime; in addition, A000041(6^3) and A000041(6^1) are prime, but for no other powers A000041(6^k) is known (or can be expected) to be prime. %C A284594 a(7) > 649350. %H A284594 Chris K. Caldwell, <a href="https://t5k.org/top20/page.php?id=54">Top twenty prime partition numbers</a>, The Prime Pages. %H A284594 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PartitionFunctionP.html">Partition Function P</a> %H A284594 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IntegerSequencePrimes.html">Integer Sequence Primes</a> %e A284594 a(2) = 6 is in the sequence because A000041(6^2) = 17977 is a prime. %o A284594 (PARI) for(n=1,2500,if(ispseudoprime(numbpart(n^2)),print1(n,", "))) %Y A284594 Cf. A000041, A046063, A072213, A285086, A285087, A285088. %K A284594 nonn,hard,more %O A284594 1,1 %A A284594 _Serge Batalov_, Mar 29 2017