cp's OEIS Frontend

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.

A285086 Numbers n such that the number of partitions of n^2+1 (=A000041(n^2+1)) is prime.

Original entry on oeis.org

1, 2, 3914
Offset: 1

Views

Author

Serge Batalov, Apr 09 2017

Keywords

Comments

Because asymptotically A000041(n^2+1) ~ exp(Pi*sqrt(2/3*(n^2+1))) / (4*sqrt(3)*(n^2+1)), the sum of the prime probabilities ~ 1/log(A000041(n^2+1)) is diverging and there are no obvious restrictions on primality; therefore, this sequence may be conjectured to be infinite.
a(4) > 90000.

Examples

			a(2) = 2 is in the sequence because A000041(2^2+1) = 7 is a prime.
		

Crossrefs

Programs

  • PARI
    for(n=1,3920,if(ispseudoprime(numbpart(n^2+1)),print1(n,", ")))