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.

Showing 1-2 of 2 results.

A236413 Positive integers m with p(m)^2 + q(m)^2 prime, where p(.) is the partition function (A000041) and q(.) is the strict partition function (A000009).

Original entry on oeis.org

1, 2, 3, 4, 6, 17, 24, 37, 44, 95, 121, 162, 165, 247, 263, 601, 714, 742, 762, 804, 1062, 1144, 1149, 1323, 1508, 1755, 1833, 1877, 2330, 2380, 2599, 3313, 3334, 3368, 3376, 3395, 3504, 3688, 3881, 4294, 4598, 4611, 5604, 5696, 5764, 5988, 6552, 7206, 7540, 7689
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 24 2014

Keywords

Comments

According to the conjecture in A236412, this sequence should have infinitely many terms.
See A236414 for primes of the form p(m)^2 + q(m)^2.
See also A236440 for a similar sequence.

Examples

			a(1) = 1 since p(1)^2 + q(1)^2 = 1^2 + 1^2 = 2 is prime.
a(2) = 2 since p(2)^2 + q(2)^2 = 2^2 + 1^2 = 5 is prime.
a(3) = 3 since p(3)^2 + q(3)^2 = 3^2 + 2^2 = 13 is prime.
		

Crossrefs

Programs

  • Mathematica
    pq[n_]:=PrimeQ[PartitionsP[n]^2+PartitionsQ[n]^2]
    n=0;Do[If[pq[m],n=n+1;Print[n," ",m]],{m,1,10000}]

A236440 Positive integers m with A000009(m)^2 + A047967(m)^2 prime.

Original entry on oeis.org

2, 3, 4, 13, 18, 23, 44, 52, 54, 67, 82, 93, 139, 155, 166, 185, 196, 249, 299, 333, 382, 559, 574, 911, 939, 1076, 1077, 1386, 1707, 1710, 1872, 2041, 2120, 2172, 2234, 2810, 3272, 3407, 3442, 3469, 3551, 3657, 3694, 4185, 4282, 4469, 4554, 5273, 5315, 5729
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 25 2014

Keywords

Comments

According to the conjecture in A236439, this sequence should have infinitely many terms.

Examples

			a(1) = 2 since A000009(2)^2 + A047967(2)^2 = 1^2 + 1^2 =2 is prime, but A000009(1)^2 + A047967(1)^2 = 1^2 + 0^2 is not.
		

Crossrefs

Programs

  • Mathematica
    pq[n_]:=PrimeQ[PartitionsQ[n]^2+(PartitionsP[n]-PartitionsQ[n])^2]
    n=0;Do[If[pq[m],n=n+1;Print[n," ",m]],{m,1,10000}]
Showing 1-2 of 2 results.