A053160 -id:A053160 - cp's OEIS frontend

A053095 Number of primes having exactly the same digits as appear in first n primes.

1, 1, 1, 8, 62, 568, 5370, 114546, 2898058, 0, 1119268465, 26053674813

Offset: 1

Enoch Haga, Mar 19 2000

a(n) = 0 if sum of digits is a multiple of three (see A103208). - Ray Chandler, Apr 07 2010

			a(4) = 8 because the first four prime n, concatenated, are 2+3+5+7 or 2357. There are 8 prime arrangements: 2357, 2753, 3257, 3527, 5237, 5273, 7253, 7523.

Cf. A054260, A053160, A053161, A103208.

from sympy import isprime, prime
from sympy.utilities.iterables import multiset_permutations
def A053095(n):
    return sum(1 for d in multiset_permutations(''.join(str(prime(m+1)) for m in range(n))) if isprime(int(''.join(d)))) # Chai Wah Wu, Mar 17 2019

a(7)-a(9) from Ray Chandler, Apr 07 2010
a(10) from Ray Chandler, Apr 08 2010
a(11) from Michael S. Branicky, Mar 17 2025
a(12) from Michael S. Branicky, Apr 07 2025

A053161 Largest prime associated with A053095(n), or zero if no such prime exists.

Original entry on oeis.org

2, 23, 523, 7523, 751321, 75331211, 7753211113, 977533111211, 97753332211111, 0, 997753333211111221, 99777533333211211211, 9977754333332221111111, 997775443333332211121111, 99777754443333332111212111, 0, 999777755544433333332121111121, 0, 9997777766555444333333321211112111

Offset: 1

Enoch Haga, Mar 19 2000

			a(7)=7753211113 because it is the largest prime consisting of the digits 2+3+5+7+11+13+17.

Chai Wah Wu, Table of n, a(n) for n = 1..298

Cf. A053095, A053160.

Edited and extended by Ray Chandler, Apr 08 2010

a(17)-a(19) from Chai Wah Wu, Mar 17 2019

cp's OEIS Frontend

A053095 Number of primes having exactly the same digits as appear in first n primes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Python

Extensions