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!)
 A052494 Number of different primes that can be formed by permuting digits of n-th prime. 1
 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 1, 1, 2, 1, 3, 2, 3, 3, 2, 4, 1, 3, 3, 3, 3, 4, 2, 2, 2, 4, 3, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 1, 3, 2, 3, 2, 3, 2, 2, 1, 3, 2, 3, 4, 1, 3, 4, 1, 1, 4, 2, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 1, 4, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,6 COMMENTS Leading zeros not permitted, so, e.g., prime(27) = 103 but a(27) = 1 even though 13 and 31 are both primes. - Harvey P. Dale, Dec 17 2012 LINKS EXAMPLE a(75)=4 because the digits in 379 may be arranged to form a total of 4 primes: 379, 397, 739 and 937. MATHEMATICA ndp[n_]:=Module[{pers=FromDigits/@Permutations[IntegerDigits[n]]}, Count[ pers, _?(IntegerLength[#]==IntegerLength[n]&&PrimeQ[#]&)]]; ndp/@ Prime[ Range[110]] (* Harvey P. Dale, Dec 17 2012 *) CROSSREFS Sequence in context: A274109 A083019 A137865 * A317756 A039998 A316089 Adjacent sequences:  A052491 A052492 A052493 * A052495 A052496 A052497 KEYWORD base,easy,nonn AUTHOR Enoch Haga, Mar 16 2000 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 September 22 07:34 EDT 2020. Contains 337289 sequences. (Running on oeis4.)