cp's OEIS Frontend

A360301 Smallest exclusionary square (A029783) with exactly n distinct prime factors.

%I A360301 #33 Feb 16 2025 08:34:04
%S A360301 2,18,84,858,31122,3383898,188841114,68588585868,440400004044,
%T A360301 7722272777722272
%N A360301 Smallest exclusionary square (A029783) with exactly n distinct prime factors.
%C A360301 There is no 5 in the prime factorization of these terms.
%C A360301 No other terms less than 10^14. - _Michael S. Branicky_, Feb 02 2023
%C A360301 1.69 * 10^15 < a(10) <= 7722272777722272. - _Daniel Suteu_, Feb 05 2023
%D A360301 Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 60.
%D A360301 David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Revised Edition, 1997, page 144, entry 567.
%H A360301 Cliff Pickover et al., <a href="https://groups.google.com/forum/#!topic/rec.puzzles/ubSItPD_DGY">Exclusionary Squares and Cubes</a>, rec.puzzles topic on google groups, January 2002.
%H A360301 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DistinctPrimeFactors.html">Distinct Prime Factors</a>.
%F A360301 Assuming a(n) exists, a(n) >= A002110(n+1)/5 >> exp((1 + o(1)) * n * log(n)). (The inequality is presumably strict for all n; for n > 34 it seems that all A002110(n) are pandigital.) - _Charles R Greathouse IV_, Feb 05 2023
%e A360301 84 = 2^2 * 3 * 7 is the smallest integer with 3 distinct prime factors that is also an exclusionary square, because 84^2 = 7056, so a(3) = 84.
%e A360301 858 = 2 * 3 * 11 * 13 is the smallest integer with 4 distinct prime factors that is also an exclusionary square, because 858^2 = 736164, so a(4) = 858.
%o A360301 (PARI)
%o A360301 omega_exclusionary_squares(A, B, n) = A=max(A, vecprod(primes(n))); (f(m, p, j) = my(list=List()); forprime(q=p, sqrtnint(B\m, j), if(q == 5, next); my(v=m*q); while(v <= B, if(j==1, if(v>=A && #setintersect(Set(digits(v)), Set(digits(v^2))) == 0, listput(list, v)), if(v*(q+1) <= B, list=concat(list, f(v, q+1, j-1)))); v *= q)); list); vecsort(Vec(f(1, 2, n)));
%o A360301 a(n) = my(x=vecprod(primes(n)), y=2*x); while(1, my(v=omega_exclusionary_squares(x, y, n)); if(#v >= 1, return(v[1])); x=y+1; y=2*x); \\ _Daniel Suteu_, Feb 05 2023
%Y A360301 Cf. A029783.
%Y A360301 Similar: A060319 (Fibonacci), A083002 (oblong), A359960 (Niven), A359961 (Zuckerman).
%K A360301 nonn,base,more
%O A360301 1,1
%A A360301 _Bernard Schott_, Feb 02 2023
%E A360301 a(4)-a(7) from _Amiram Eldar_, Feb 02 2023
%E A360301 a(8)-a(9) from _Michael S. Branicky_, Feb 02 2023
%E A360301 a(10) from _Michael S. Branicky_, Feb 07 2023