|
%I #13 Apr 24 2022 02:31:09
%S 4,8,9,12,25,30,49,56,63,121,132,169,182,195,289,306,361,380,399,529,
%T 552,575,841,870,961,992,1023,1369,1406,1443,1681,1722,1849,1892,1935,
%U 2209,2256,2303,2809,2862,2915,3481,3540,3721,3782,3843,4489,4556,4623
%N Numbers k such that the largest prime factor of k is equal to floor(sqrt(k)).
%H Amiram Eldar, <a href="/A071835/b071835.txt">Table of n, a(n) for n = 1..10000</a>
%t Select[Range[2, 5000], FactorInteger[#][[-1,1]] == Floor[Sqrt[#]] &] (* _Amiram Eldar_, Apr 23 2022 *)
%o (PARI) for(n=2,10000,if(component(component(factor(n),1),omega(n))==floor(sqrt(n)),print1(n,",")))
%Y Cf. A000196, A006530.
%K easy,nonn
%O 1,1
%A _Benoit Cloitre_, Jun 08 2002
|
