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.

A226768 Least prime in a string of exactly n consecutive primes all differing by 3-almost primes (A014612).

Original entry on oeis.org

2, 89, 199, 4679, 1499, 24593, 118801, 318569, 1055741, 2253311, 3695513, 4559983, 22790969, 29625383, 85780433, 108547289, 1092631789, 520956851, 23522240041, 11229387053, 50466176303, 325923513479, 57958489439, 537724352057, 932937059897, 1970378236613, 12522644028841
Offset: 1

Views

Author

Giovanni Resta, Jun 17 2013

Keywords

Comments

a(28) > 4*10^13.

Examples

			a(3) = 199 since (199, 211, 223) is the first triple (which cannot be extended to a quadruplet) of consecutive primes whose first differences are 3-almost primes, 211-199 = 223-211 = 2^2*3.
		

Crossrefs