cp's OEIS Frontend

A162527 Numbers k whose largest divisor <= sqrt(k) equals 7.

%I A162527 #14 Jan 13 2023 13:35:46
%S A162527 49,56,63,70,77,84,91,98,105,119,133,147,161,175,203,217,245,259,287,
%T A162527 301,329,343,371,413,427,469,497,511,553,581,623,679,707,721,749,763,
%U A162527 791,889,917,959,973,1043,1057,1099,1141,1169,1211,1253,1267,1337,1351
%N A162527 Numbers k whose largest divisor <= sqrt(k) equals 7.
%C A162527 See A161344 for more information.
%H A162527 Nathaniel Johnston, <a href="/A162527/b162527.txt">Table of n, a(n) for n = 1..10000</a>
%F A162527 Numbers k such that A033676(k)=7.
%p A162527 A033676 := proc(n) local dvs; dvs := sort(convert(numtheory[divisors](n),list)) ; op(floor((nops(dvs)+1)/2) ,dvs) ; end: for n from 1 to 2000 do if A033676(n) = 7 then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009
%t A162527 ld = 7;
%t A162527 selQ[n_] := AllTrue[Divisors[n], # <= ld || #^2 > n&];
%t A162527 Select[Range[ld, 200] ld, selQ] (* _Jean-François Alcover_, Apr 14 2020 *)
%t A162527 ld7Q[n_]:=Select[Divisors[n],#<=Sqrt[n]&][[-1]]==7; Select[Range[1400],ld7Q] (* _Harvey P. Dale_, Jan 13 2023 *)
%Y A162527 Cf. A033676, A008578, A161344, A161345, A161424, A161835, A162526, A162528, A162529, A162530, A162531, A162532.
%K A162527 easy,nonn
%O A162527 1,1
%A A162527 _Omar E. Pol_, Jul 05 2009
%E A162527 More terms from _R. J. Mathar_, Jul 13 2009