The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069793 Find smallest k such that prime(k) and prime(n+k) use the same digits; sequence gives prime(k). 3

%I #5 Dec 05 2013 19:55:17

%S 2,1913,113,79,179,13,337,137,1039,37,139,619,1031,17,1123,349,563,

%T 3617,1213,1193,839,1129,617,1597,2153,1021,173,127,571,241,3037,3361,

%U 131,137,113,2141,359,1361,1471,1031,1367,587,1013,6337,251,2153,149,1049

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

%e 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 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 Cf. A069567, A069794, A069795, A069796.

%K base,nonn

%O 0,1

%A _Amarnath Murthy_, Apr 09 2002

%E Edited, corrected and extended by _Robert G. Wilson v_, Apr 12 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 23 20:31 EST 2024. Contains 370288 sequences. (Running on oeis4.)