Let omega(m) be the number of distinct prime divisors of m. Then a(n) is the largest n-digit squarefree number such that omega(n) > omega(j) for all j < n.

A074112

Let omega(m) be the number of distinct prime divisors of m. Then a(n) is the largest n-digit squarefree number such that omega(n) > omega(j) for all j < n.

Terms

    a(0) =6a(1) =78a(2) =966a(3) =9870a(4) =99330a(5) =930930a(6) =9699690a(7) =99953490a(8) =999068070a(9) =9592993410a(10) =99978788910a(11) =999890501610

External references