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-3 of 3 results.

A195353 Odd numbers n>5 in the representation n=2*p+q, p, q prime, q maximal, at which a larger p than for any smaller n is needed. A195354 gives values of p.

Original entry on oeis.org

7, 13, 31, 91, 451, 539, 1397, 1417, 1777, 3139, 14419, 39751, 77507, 96157, 158173, 214979, 263113, 496723, 1046179, 3415297, 3546371, 4306549, 9456677, 18338311, 45521269, 243377803, 766707661, 1023263789, 8032822531, 92635306249, 151318414531, 352799777983
Offset: 1

Views

Author

Hugo Pfoertner, Sep 16 2011

Keywords

Comments

2*(Positions of records in A195352) + 1.
Checked up to n = 10^13.

Examples

			a(3)=31 because it is the first number for which the representation n=2*p+q needs a larger value of p than for all smaller odd numbers. 31=2*7+17, whereas all smaller odd n can be expressed using p=2 or p=3.
		

References

Crossrefs

Cf. A195352, A195354 (records of p), A194828 (similar, but looking for records of q with p maximized)

Extensions

a(36)-a(41) from Hugo Pfoertner, Sep 26 2011

A194829 Records of primes q in the representation of odd n>5 by n=2*p+q, p, q prime, q minimal. A194828 gives the values of n at which an increase of q is required.

Original entry on oeis.org

3, 5, 7, 13, 17, 37, 61, 73, 109, 181, 277, 317, 349, 397, 419, 503, 577, 601, 709, 829, 877, 1129, 1237, 1367, 1429, 1669, 1993, 2467, 2833, 2879, 3001, 3037, 3329, 3821, 4861, 5003, 5281, 5821, 5897, 6301, 6329, 6421, 7129, 7309, 7873, 8017, 8597, 8821, 8969, 9157
Offset: 1

Views

Author

Hugo Pfoertner, Sep 03 2011

Keywords

Comments

See A002091. Checked up to n=2*10^13.

Examples

			a(5)=17, because it is the smallest possible value of q in the representation of 55=2*p+q. 55-3=52, 55-5=50, 55-7=48, 55-11=44, 55-13=42, none of which has the form 2*p. 55-17=38=2*19. All odd numbers < 55 can be represented using a q<17.
		

References

Crossrefs

Cf. A194828, A002091, A002092 [q=1 allowed], A195354.

Extensions

a(35)-a(43) from Hugo Pfoertner, Sep 11 2011
a(44)-a(49) from Hugo Pfoertner, Sep 18 2011
a(50) from Hugo Pfoertner, Sep 22 2011

A195352 Smallest prime p such that 2*n+1 = 2*p + q for some odd prime q.

Original entry on oeis.org

2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 7, 2, 2, 3, 5, 2, 3, 2, 2, 3, 2, 3, 7, 2, 3, 7, 2, 2, 3, 5, 2, 3, 2, 2, 3, 5, 2, 3, 2, 3, 19, 2, 3, 7, 5, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 7, 5, 11, 7, 11, 2, 3, 2, 3, 13, 2, 2, 3, 5, 5, 7, 2, 2, 3, 5, 2, 3, 7, 2, 3, 2, 3, 13
Offset: 3

Views

Author

Hugo Pfoertner, Sep 16 2011

Keywords

Comments

Related to Lemoine's conjecture, which states that all odd integers > 5 can be represented as 2*p+q, p, q primes.

Examples

			a(3)=2 because 2*3+1=7=2*2+3; a(4)=2: 2*3+1=9=2*2+5; a(5)=2: 11=2*2+7; a(6)=3: 13=2*3+7.
		

References

Crossrefs

Cf. A002091, A103506 (smallest q), A046927, A195353 (positions of records), A195354 (records), A103153 (prime p=2 excluded), A185091.

Programs

  • Mathematica
    spp[n_]:=Module[{p=2},While[CompositeQ[(2n+1)-2p],p=NextPrime[p]];p]; Array[ spp,90,3] (* Harvey P. Dale, Jun 02 2022 *)
Showing 1-3 of 3 results.