login
(Greatest power of smallest prime factor of n) < square root(n).
0

%I #8 Feb 13 2018 18:41:05

%S 6,10,14,15,18,20,21,22,26,28,30,33,34,35,36,38,39,42,44,46,50,51,52,

%T 54,55,57,58,60,62,65,66,68,69,70,72,74,75,76,77,78,82,84,85,86,87,88,

%U 90,91,92,93,94,95,98,99,100,102,104,105,106,108,110,111,114,115

%N (Greatest power of smallest prime factor of n) < square root(n).

%C A028233(a(n))^2 < a(n);

%C a(n)=A085232(n) for n<69: a(69)=120, A085232(69)=122=a(70).

%p isA085234 := proc(n)

%p if A028233(n)^2 < n then

%p true;

%p else

%p false;

%p end if;

%p end proc:

%p for n from 1 to 115 do

%p if isA085234(n) then

%p printf("%d,",n);

%p end if;

%p end do: # _R. J. Mathar_, Jul 09 2016

%t okQ[n_] := Power @@ FactorInteger[n][[1]] < Sqrt[n]; Select[Range[120], okQ] (* _Jean-François Alcover_, Feb 13 2018 *)

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Jun 22 2003