

A134641


Prime permutational numbers A134640.


11




OFFSET

1,1


COMMENTS

Conjecture: This sequence is finite and complete.
The conjecture is correct: in base 2k permutational numbers are divisible by 2k1 and in base 2k+1 permutational numbers are divisible by k. Hence it suffices to check bases up to 3.  Charles R Greathouse IV, Dec 14 2015


LINKS

Table of n, a(n) for n=1..5.


MATHEMATICA

a = {}; b = {}; Do[AppendTo[b, n]; w =Permutations[b]; Do[j = FromDigits[w[[m]], n + 1]; If[PrimeQ[j], AppendTo[a, j]], {m, 1, Length[w]}], {n, 0, 10}]; a (*Artur Jasinski*)


PROG

(PARI) for(b=2, 3, for(i=0, b!1, p=fromdigits(apply(j>j1, numtoperm(b, i)), b); if(isprime(p), print1(p", ")))) \\ Charles R Greathouse IV, Dec 14 2015


CROSSREFS

Cf. A134640.
Sequence in context: A224320 A247052 A163695 * A162491 A152216 A045350
Adjacent sequences: A134638 A134639 A134640 * A134642 A134643 A134644


KEYWORD

nonn,fini,full


AUTHOR

Artur Jasinski, Nov 05 2007


STATUS

approved



