OFFSET
1,2
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..75 (all terms < 10^9)
EXAMPLE
p(86543) = 1111189.
PROG
(Python)
from sympy import sieve
from itertools import count, islice, combinations_with_replacement as mc
def nd(n): s = str(n); return s == "".join(sorted(s))
def bgen(d):
ni = map(int, ("".join(m) for m in mc("9876543210", d)))
yield from sorted(k for k in ni if k != 0)
def agen():
for d in count(1):
yield from (k for k in bgen(d) if nd(sieve[k]))
print(list(islice(agen(), 55))) # Michael S. Branicky, Jun 26 2022
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Giovanni Resta, Feb 13 2006
STATUS
approved