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).

This page as a plain text file.
%I A069793 #5 Dec 05 2013 19:55:17
%S A069793 2,1913,113,79,179,13,337,137,1039,37,139,619,1031,17,1123,349,563,
%T A069793 3617,1213,1193,839,1129,617,1597,2153,1021,173,127,571,241,3037,3361,
%U A069793 131,137,113,2141,359,1361,1471,1031,1367,587,1013,6337,251,2153,149,1049
%N A069793 Find smallest k such that prime(k) and prime(n+k) use the same digits; sequence gives prime(k).
%e A069793 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.
%t A069793 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}]
%Y A069793 Cf. A069567, A069794, A069795, A069796.
%K A069793 base,nonn
%O A069793 0,1
%A A069793 _Amarnath Murthy_, Apr 09 2002
%E A069793 Edited, corrected and extended by _Robert G. Wilson v_, Apr 12 2002