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.

A083750 Numbers n such that 2111131111...p(n-1)1111p(n) is prime.

Original entry on oeis.org

85, 145, 304, 915
Offset: 1

Views

Author

Farideh Firoozbakht, Jun 17 2003

Keywords

Comments

Let fp(n,k) be the decimal concatenation of prime(n), k, and fp(n-1,k) for n > 1, and fp(1,k) = 2. Then a(n) = fp(n, 1111).
No more terms up to 6300.

Examples

			a(1)=85 because fp(85,1111)= 211113111151111...4331111439 is prime and fp(k,1111) is composite for k< 85 (prime(85)=439).
a(3)=304 because fp(304,1111)=211113111151111...199911112003 is a prime related to prime year 2003; this prime number has 2231 digits. fp(915,1111)=211113111151111...712911117151 is a prime with 7119 digits (prime(915)=7151).
		

Crossrefs

Extensions

Comment from Charles R Greathouse IV, Oct 12 2009