OFFSET
1,3
COMMENTS
If a prime arises in more than one way it is only counted once (in contrast to A309460).
LINKS
Marius A. Burtea, Table of n, a(n) for n = 1..5000
EXAMPLE
For n = 1,2,3,4,... the primes are:
1: 11;
2: 11;
3: 11,13,31;
4: 11,41;
5: 11;
6: 11,13,23,31,61;
7: 11,17,71;
...
MAPLE
a:= n-> (l-> nops(select(isprime, {seq(seq(parse(
cat(i, j)), j=l), i=l)})))(numtheory[divisors](n)):
seq(a(n), n=1..100); # Alois P. Heinz, Aug 13 2019
PROG
(Magma) m:=1; sol:=[]; for u in [1..84] do d:=Divisors(u); nr:=0; prim:=[]; for i, j in [1..#d] do if IsPrime(d[i]*10^#Intseq(d[j])+d[j]) then nr:=nr+1; prim[nr]:=d[i]*10^#Intseq(d[j])+d[j]; end if; end for; sol[m]:=#Set(prim); m:=m+1; end for; sol; // Marius A. Burtea, Aug 12 2019
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Aug 12 2019
STATUS
approved