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

A190583 The smallest prime(j) in a sequence of 7 consecutive primes such that the associated 2*prime(k)+3, k=j..j+6, are also prime.

Original entry on oeis.org

4827859, 5413813, 59069473, 59069489, 171426679, 189784123, 191766193, 196232137, 306928507, 359727833, 367733497, 409634959, 452273897, 508068287, 644033227, 665209213, 737454929, 879260659, 889580717, 924491669
Offset: 1

Views

Author

Pierre CAMI, May 13 2011

Keywords

Comments

Concerning the even more stringent case of 8 consecutive primes: 59069473 is the least prime(j) of 8 consecutives primes prime(k) such that 2*prime(k)+3 are primes for k=j to j+7 and 3203934593 is the next prime with the same property.

Examples

			4827859, 4827863, ..., 4827943 are seven consecutive primes, and the associated seven 9655721, 9655729, ..., 9655889 are also prime numbers. This puts 4827859 into the sequence.
		

Crossrefs

Cf. A190478.

Programs

  • Maple
    isA023204 := proc(n) isprime(n) and isprime(2*n+3) ; end proc:
    isA190583 := proc(n) local q,s ; q := n ; if isA023204(q) then for s from 1 to 6 do q := nextprime(q) ; if not isA023204(q) then return false; end if; end do; return true; else return false; end if; end proc:
    p := 2 : for i from 1 do if isA190583(p) then print(p) ; end if; p := nextprime(p) ; end do: # R. J. Mathar, Jun 02 2011
Showing 1-1 of 1 results.