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.

A236414 Primes of the form p(m)^2 + q(m)^2 with m > 0, where p(.) is the partition function (A000041) and q(.) is the strict partition function (A000009).

Original entry on oeis.org

2, 5, 13, 29, 137, 89653, 2495509, 468737369, 5654578481, 10952004689145437, 4227750418844538601, 16877624537532512753869, 29718246090638680022401, 33479444420637044862046313837, 386681772864767371008755193761
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 24 2014

Keywords

Comments

This is a subsequence of A233346. All terms after the first term are congruent to 1 modulo 4.
According to the conjecture in A236412, this sequence should have infinitely many terms. See A236413 for positive integers m with p(m)^2 + q(m)^2 prime.

Examples

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

Crossrefs

Programs

  • Mathematica
    a[n_]:=PartitionsP[A236413(n)]^2+PartitionsQ[A236413(n)]^2
    Table[a[n],{n,1,15}]