When written in base 10, the terms consist of n digits '1' separated by strings of n1 digits '0'.
This sequence is relevant for counterexamples to a conjecture in A086766: If p is prime and a(p) is not prime, then A086766(10^(p1)) = 0.
a(n) is the product of A019328(d) for all d that divide n^2 but not n.  Robert Israel, Jan 08 2015
If a(n) is a prime then n is a prime. What is the smallest prime term greater than 101 in this sequence?  Farideh Firoozbakht, Jan 08 2015
According to what precedes, a(n) is prime iff A019328(d) is prime, where d is the only divisor of n^2 which is not a divisor of n, i.e., iff n is a prime and n^2 is in A138940. No such term is known, except for n=2.  M. F. Hasler, Jan 09 2015
