cp's OEIS Frontend

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

%I A085234 #8 Feb 13 2018 18:41:05
%S A085234 6,10,14,15,18,20,21,22,26,28,30,33,34,35,36,38,39,42,44,46,50,51,52,
%T A085234 54,55,57,58,60,62,65,66,68,69,70,72,74,75,76,77,78,82,84,85,86,87,88,
%U A085234 90,91,92,93,94,95,98,99,100,102,104,105,106,108,110,111,114,115
%N A085234 (Greatest power of smallest prime factor of n) < square root(n).
%C A085234 A028233(a(n))^2 < a(n);
%C A085234 a(n)=A085232(n) for n<69: a(69)=120, A085232(69)=122=a(70).
%p A085234 isA085234 := proc(n)
%p A085234     if A028233(n)^2 < n then
%p A085234         true;
%p A085234     else
%p A085234         false;
%p A085234     end if;
%p A085234 end proc:
%p A085234 for n from 1 to 115 do
%p A085234     if isA085234(n) then
%p A085234         printf("%d,",n);
%p A085234     end if;
%p A085234 end do: # _R. J. Mathar_, Jul 09 2016
%t A085234 okQ[n_] := Power @@ FactorInteger[n][[1]] < Sqrt[n]; Select[Range[120], okQ] (* _Jean-François Alcover_, Feb 13 2018 *)
%K A085234 nonn
%O A085234 1,1
%A A085234 _Reinhard Zumkeller_, Jun 22 2003