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.

A234530 Primes p with q(p) + 1 also prime, where q(.) is the strict partition function (A000009).

Original entry on oeis.org

2, 3, 11, 13, 29, 37, 47, 71, 79, 89, 103, 127, 131, 179, 181, 197, 233, 271, 331, 379, 499, 677, 691, 757, 887, 911, 1019, 1063, 1123, 1279, 1429, 1531, 1559, 1637, 2251, 2719, 3571, 4007, 4201, 4211, 4297, 4447, 4651, 4967, 5953, 6131, 7937, 8233, 8599, 8819, 9013, 11003, 11093, 11813, 12251, 12889, 12953, 13487, 13687, 15259
Offset: 1

Views

Author

Zhi-Wei Sun, Dec 27 2013

Keywords

Comments

By the conjecture in A234514, this sequence should have infinitely many terms.
It seems that a(n+1) < a(n) + a(n-1) for all n > 4.
See A234366 for primes of the form q(p) + 1 with p prime.
See also A234644 for a similar sequence.

Examples

			a(1) = 2 since 2 and q(2) + 1 = 2 are both prime.
a(2) = 3 since 3 and q(3) + 1 = 3 are both prime.
a(3) = 11 since 11 and q(11) + 1 = 13 are both prime.
		

Crossrefs

Programs

  • Mathematica
    n=0;Do[If[PrimeQ[PartitionsQ[Prime[k]]+1],n=n+1;Print[n," ",Prime[k]]],{k,1,10^5}]
    Select[Prime[Range[2000]],PrimeQ[PartitionsQ[#]+1]&] (* Harvey P. Dale, Apr 23 2017 *)

A234647 Primes of the form q(p) - 1, where p is a prime and q(.) is the strict partition function (A000009).

Original entry on oeis.org

2, 11, 17, 37, 53, 103, 1259, 1609, 5119, 9791, 70487, 570077, 20792119, 281138047, 23515017983, 35692320959, 48626519093, 3626048321047, 27077619952639, 1651411233432319, 10743948315198451, 13378670620050079, 39413984631175423, 58553713102334907283, 145464242180631569963, 25408177717067357968543, 1374387931601409538722802926765483199, 20557774525717988142856527912112710143, 326033386646595458662191828888146112979, 27403889354101748193301659902924397784656229
Offset: 1

Views

Author

Zhi-Wei Sun, Dec 29 2013

Keywords

Comments

Though the primes in this sequence are very rare, by the conjecture in A234615 there should be infinitely many such primes.
See A234644 for a list of known primes p with q(p) - 1 prime.

Crossrefs

Programs

  • Maple
    a(1) = 2 since 2 = q(5) - 1 with 2 and 5 both prime.
  • Mathematica
    p[n_]:=A234615(n)
    Table[PartitionsQ[p[n]]-1,{n,1,30}]

Formula

a(n) = A000009(A234615(n)) - 1.
Showing 1-2 of 2 results.