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.

A157885 Least prime that starts a run of exactly n consecutive primes, where between successive primes exactly one digit changes and the resulting digits may be permuted.

Original entry on oeis.org

113, 23, 41, 2, 61, 1613, 311, 2011, 401, 4261, 6067, 852851, 1977623, 19599043, 627071, 35356513, 331085113, 1524559739
Offset: 1

Views

Author

Ray Chandler, Mar 09 2009

Keywords

Comments

One and only one digit can change between any two successive primes in a run, rearrangement is optional as defined in A157717.

Examples

			n: prime run.
1: 113.
2: 23, 29.
3: 41, 43, 47.
4: 2, 3, 5, 7.
5: 61, 67, 71, 73, 79.
6: 1613, 1619, 1621, 1627, 1637, 1657.
7: 311, 313, 317, 331, 337, 347, 349.
8: 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069.
9: 401, 409, 419, 421, 431, 433, 439, 443, 449.
10: 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349.
11: 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143.
		

Crossrefs

Cf. A157717.