|
%I #18 Aug 11 2022 03:19:19
%S 3313,3331,32233,32323,33223,123323,132233,223133,223313,223331,
%T 231323,233231,312233,321323,323123,3344443,3434443,3443443,4434343,
%U 4443433,14334443,14443343,14443433,31434443,31443443,33434441,33555553
%N Primes p such that every decimal digit d in p appears exactly d times.
%C The largest term is the prime 99999999988888888777777766666655555444223343.
%H Giovanni Resta, <a href="/A078348/b078348.txt">Table of n, a(n) for n = 1..10000</a>
%e In the prime 3313 the digit "1" appears exactly one time and the digit "3" appears exactly three times.
%t ddp[x_]:=Select[FromDigits/@Permutations[Flatten[PadRight[{},#,#]&/@x]], PrimeQ]; Take[Flatten[ddp/@Subsets[Range[5]]]//Sort,40] (* _Harvey P. Dale_, May 13 2020 *)
%o (Python)
%o from sympy import isprime
%o from itertools import chain, combinations as C, count, islice
%o from sympy.utilities.iterables import multiset_permutations as mp
%o def powerset(s):
%o return chain.from_iterable(C(s, r) for r in range(len(s)+1))
%o def agen():
%o sumlst = [[] for i in range(46)]
%o for s in powerset(range(1, 10)): sumlst[sum(s)].append(s)
%o for numdigits in count(1):
%o found = set()
%o for t in sumlst[numdigits]:
%o diglst = "".join(str(i)*i for i in t)
%o for m in mp(diglst, numdigits):
%o t = int("".join(m))
%o if isprime(t): found.add(t)
%o yield from sorted(found)
%o print(list(islice(agen(), 30))) # _Michael S. Branicky_, Aug 10 2022
%Y Primes in A108571.
%K base,easy,fini,nonn
%O 1,1
%A _Carlos Rivera_, Nov 22 2002
| 