|
Search: id:A071965
|
|
|
| A071965 |
|
Numbers n such that n = Lpf(n)*Lpf(sigma(n)) where Lpf(x) = A006530(x) is the largest prime factor of x. |
|
+0
1
|
|
| 15, 33, 51, 69, 91, 95, 141, 145, 159, 213, 287, 295, 321, 395, 445, 473, 573, 581, 679, 703, 745, 895, 973, 995, 1139, 1149, 1169, 1195, 1199, 1293, 1339, 1345, 1441, 1561, 1717, 1757, 1795, 1891, 1941, 2051, 2147, 2167, 2245, 2353, 2395, 2443, 2495, 2589
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
PROGRAM
|
(PARI) for(n=1, 3000, if(vecmax(component(factor(n), 1))*vecmax(component(factor(sigma(n)), 1))==n, print1(n, ", ")))
|
|
CROSSREFS
|
Sequence in context: A140608 A085371 A162887 this_sequence A020184 A108517 A085803
Adjacent sequences: A071962 A071963 A071964 this_sequence A071966 A071967 A071968
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 16 2002
|
|
|
Search completed in 0.002 seconds
|
