A088633 -id:A088633 - cp's OEIS frontend

A060264 First prime after 2n.

2, 3, 5, 7, 11, 11, 13, 17, 17, 19, 23, 23, 29, 29, 29, 31, 37, 37, 37, 41, 41, 43, 47, 47, 53, 53, 53, 59, 59, 59, 61, 67, 67, 67, 71, 71, 73, 79, 79, 79, 83, 83, 89, 89, 89, 97, 97, 97, 97, 101, 101, 103, 107, 107, 109, 113, 113, 127, 127, 127, 127, 127, 127, 127, 131

Offset: 0

Labos Elemer, Mar 23 2001

Conjecture: for n > 2, this is the least prime p such that 1^2, 2^2, 3^2, ..., n^2 are distinct mod p. Checked to 10^4. - Charles R Greathouse IV, Dec 03 2022

Harry J. Smith, Table of n, a(n) for n = 0..1000

Cf. A020482, A049653, A059786, A060308, A088633, A151800.

Cf. A005843.

a060264 = a151800 . (* 2)  -- Reinhard Zumkeller, Nov 15 2013

A060264 := proc(n)
        nextprime(2*n) ;
end proc:

Table[NextPrime[2n],{n,0,100}] (* Vladimir Joseph Stephan Orlovsky, Mar 03 2011 *)

a(n) = nextprime(2*n + 1)  \\ Harry J. Smith, Jul 03 2009

a(n) = A151800(2*n). - Reinhard Zumkeller, Nov 15 2013

A088631 Largest number m < n such that m+n is a prime.

Original entry on oeis.org

1, 2, 3, 2, 5, 6, 5, 8, 9, 8, 11, 10, 9, 14, 15, 14, 13, 18, 17, 20, 21, 20, 23, 22, 21, 26, 25, 24, 29, 30, 29, 28, 33, 32, 35, 36, 35, 34, 39, 38, 41, 40, 39, 44, 43, 42, 41, 48, 47, 50, 51, 50, 53, 54, 53, 56, 55, 54, 53, 52, 51, 50, 63, 62, 65, 64, 63, 68, 69, 68, 67, 66, 65, 74, 75

Offset: 2

N. J. A. Sloane, Nov 24 2003

			Adding 1,2,3,2,5 to 2,3,4,5,6 we get the primes 3,5,7,7,11.

Reinhard Zumkeller, Table of n, a(n) for n = 2..10000

Cf. A088633. Second column of A088643.

Cf. A010051, A060265, A007917.

a088631 n = a060265 n - n  -- Reinhard Zumkeller, Feb 22 2015

with(numtheory); A088631 := n->prevprime(2*n)-n;

a(n) = p-n where p = largest prime <= 2n-1.

a(n) = A060265(n) - n. - Reinhard Zumkeller, Feb 22 2015

cp's OEIS Frontend

A060264 First prime after 2n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula