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.

A069793 Find smallest k such that prime(k) and prime(n+k) use the same digits; sequence gives prime(k).

Original entry on oeis.org

2, 1913, 113, 79, 179, 13, 337, 137, 1039, 37, 139, 619, 1031, 17, 1123, 349, 563, 3617, 1213, 1193, 839, 1129, 617, 1597, 2153, 1021, 173, 127, 571, 241, 3037, 3361, 131, 137, 113, 2141, 359, 1361, 1471, 1031, 1367, 587, 1013, 6337, 251, 2153, 149, 1049
Offset: 0

Views

Author

Amarnath Murthy, Apr 09 2002

Keywords

Examples

			a(1) = 1913 as the next prime 1931 uses the same digits. a(2) = 113 as the next to next prime 131 uses the same digits.
		

Crossrefs

Programs

  • Mathematica
    Do[a = {{{0}}}; a = Flatten[ Append[a, Table[{1}, {n}]], 1]; k = 1; While[ a[[1]] != a[[ -1]], a = Drop[a, 1]; k++; a = Append[a, Sort[ IntegerDigits[ Prime[k]]]]]; Print[ Prime[k - n]], {n, 1, 40}]

Extensions

Edited, corrected and extended by Robert G. Wilson v, Apr 12 2002