A080794 - OEIS

%I #13 Sep 11 2022 00:34:34

%S 7,73,94,217,281,309,321,324,325,392,624,715,751,841,886,945,976,1307,

%T 1384,1395,1491,1492,1532,1723,1785,1970,2741,2845,2956,2971,2977,

%U 3593,3637,3673,3751,3805,4153,4230,4321,4345,4391,4437,4759,4978,4980,5174,5317

%N Numbers k whose digits are all contained, in any order, within the digits of prime(k).

%H Michael S. Branicky, <a href="/A080794/b080794.txt">Table of n, a(n) for n = 1..10000</a>

%e 6347 is a term because prime(6347) = 63347.

%e 886 is a term because prime(886) = 6883.

%e 11 is not a term because prime(11) = 31, which does not contain two 1's.

%t okQ[n_] := Module[{idnp=IntegerDigits[Prime[n]], sidn=Sort[IntegerDigits[n]]}, Intersection[idnp, sidn]==sidn]; Select[Range[10000], okQ]

%o (Python)

%o from sympy import nextprime

%o from collections import Counter

%o from itertools import count, islice

%o def agen2(): # generator of terms

%o     pk = 2

%o     for k in count(1):

%o         cpk, ck = Counter(str(pk)), Counter(str(k))

%o         if all(cpk[d] >= ck[d] for d in ck): yield (k, pk)

%o         pk = nextprime(pk)

%o print(list(islice(agen2(), 47))) # _Michael S. Branicky_, Sep 10 2022

%K base,easy,nonn

%O 1,1

%A _Harvey P. Dale_, Mar 13 2003

%E Missing terms inserted by _Michael S. Branicky_, Sep 10 2022