OFFSET
1,2
COMMENTS
Do all primes p > 5 have a multiple in this sequence? This holds at least for p < 10^4. - Charles R Greathouse IV, Sep 23 2016
Conjecture: this sequence is a subsequence of A003136 (Loeschian numbers). - Davide Rotondo, Jan 02 2022
If m is not in A003136, there is a prime p == 2 (mod 3) such that the exponent of p in the factorization of m is odd, then we have 3 | 1+p | 1+p+p^2+...+p^(2*r-1) | sigma(m), sigma = A000203 is the sum of divisors, so the concatenation of the divisors of m is also divisible by 3. - Jianing Song, Aug 22 2022
LINKS
Bill McEachen, Table of n, a(n) for n = 1..10000
EXAMPLE
a(6) = 21: the divisors of 21 are 1,3,7,21, and their concatenation 13721 is noncomposite.
MATHEMATICA
Select[Range[10^3], ! CompositeQ@ FromDigits@ Flatten@ IntegerDigits@ Divisors@ # &] (* Michael De Vlieger, Sep 23 2016 *)
PROG
(PARI) is(n)=my(d=divisors(n)); d[1]="1"; isprime(eval(concat(d))) || n==1 \\ Charles R Greathouse IV, Sep 23 2016
(Python)
from sympy import divisors, isprime
def ok(m): return m==1 or isprime(int("".join(str(d) for d in divisors(m))))
print([m for m in range(1, 900) if ok(m)]) # Michael S. Branicky, Feb 05 2022
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Jaroslav Krizek, Apr 20 2010
EXTENSIONS
Edited and extended by Charles R Greathouse IV, Apr 30 2010
Data corrected by Bill McEachen, Nov 03 2021
STATUS
approved