login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A071835
Numbers k such that the largest prime factor of k is equal to floor(sqrt(k)).
2
4, 8, 9, 12, 25, 30, 49, 56, 63, 121, 132, 169, 182, 195, 289, 306, 361, 380, 399, 529, 552, 575, 841, 870, 961, 992, 1023, 1369, 1406, 1443, 1681, 1722, 1849, 1892, 1935, 2209, 2256, 2303, 2809, 2862, 2915, 3481, 3540, 3721, 3782, 3843, 4489, 4556, 4623
OFFSET
1,1
LINKS
MATHEMATICA
Select[Range[2, 5000], FactorInteger[#][[-1, 1]] == Floor[Sqrt[#]] &] (* Amiram Eldar, Apr 23 2022 *)
PROG
(PARI) for(n=2, 10000, if(component(component(factor(n), 1), omega(n))==floor(sqrt(n)), print1(n, ", ")))
CROSSREFS
Sequence in context: A211658 A235054 A292364 * A308416 A010429 A376357
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 08 2002
STATUS
approved