The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258706 Absolute primes: every permutation of digits is a prime. Only the smallest representative of each permutation class is shown. 9
 2, 3, 5, 7, 11, 13, 17, 37, 79, 113, 199, 337, 1111111111111111111, 11111111111111111111111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See the main entry, A003459, for further information and references cited below. The next terms are the repunit primes (A004023) R(317), too large to be displayed here, and R(1031), too large even for a b-file. Johnson (1977) proves that subsequent terms must be of the form a*R(n) + b*10^k, with a and a+b in {1..9}, k < n, and n > 9*10^9 if b != 0. - M. F. Hasler, Jun 26 2018 LINKS M. F. Hasler, Table of n, a(n) for n = 1..15 MATHEMATICA Flatten@{2, 3, 5, 7,   Table[Select[     Table @@       Prepend[Prepend[         Table[{A@k, A[k - 1], 4}, {k, 2, n}], {A, 4}],        Unevaluated[         Unevaluated[FromDigits[{1, 3, 7, 9}[[A /@ Range[n]]]]]]] //      Flatten,     Function[L,        And[PrimeQ[#],         And @@ PrimeQ[           FromDigits /@ (Permute[L, #] & /@              RandomPermutation[Length@L, 5])],         And @@ PrimeQ[FromDigits /@ Rest[Permutations[L]]]]]@       IntegerDigits@# &], {n, 2, 33}]} (* Exhaustively searches thru 33 digits in ~7.5 sec, and up to 69 digits in 5 min, but cannot reach 317 digits. Not helpful in the light of Schroeppel's theorem that it's all repunits past 991. - Bill Gosper, Jan 06 2017 *) PROG (Haskell) import Data.List (permutations, (\\)) a258706 n = a258706_list !! (n-1) a258706_list = f a000040_list where    f ps'@(p:ps) | any (== 0) (map a010051' dps) = f ps                 | otherwise = p : f (ps' \\ dps)                 where dps = map read \$ permutations \$ show p -- Reinhard Zumkeller, Jun 10 2015 (PARI) From  M. F. Hasler, Jun 26 2018: (Start) {A=[2, 5]; for(n=1, 317, my(D=[1, 3, 7, 9], r=10^n\9); for(a=1, 4, for(b=a^(n<3), 4, for(j=0, if(b!=a, n-1), ispseudoprime(D[a]*r+(D[b]-D[a])*10^j)||next(2)); A=setunion(A, [r*D[a]+(D[b]-D[a])*10^if(b=n && #select(d->d, n[^1]-n[^-1])<2 && !for(i=1, (#n)^(n[#n]>1), isprime(fromdigits(n=concat(n[^1], n)))||return)} \\ By Johnson's theorem and minimality required here, the number must be of the form ab...b or a...ab (=> first difference of digits has at most 1 nonzero component) and then is sufficient to consider rotations of the digits. (End) CROSSREFS Cf. A003459, A004023, A004022 (subsequence of repunit primes). Sequence in context: A141263 A016114 A263499 * A265408 A053434 A241716 Adjacent sequences:  A258703 A258704 A258705 * A258707 A258708 A258709 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Jun 09 2015 STATUS approved

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

Last modified July 9 11:06 EDT 2020. Contains 335543 sequences. (Running on oeis4.)