This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A307108 #21 Aug 27 2022 21:31:11 %S A307108 105,231,627,897,935,1581,1729,2465,2967,3525,4123,4301,4715,5487, %T A307108 7035,7685,7881,9717,10707,11339,14993,16377,17353,17655,20213,20915, %U A307108 23779,24765,25327,26331,26765,29341,29607,32021,33335,34881,40587,40807,42585,42911,48635 %N A307108 Numbers x that are equal to lpf(x)*gpf(x)*(lpf(x)+gpf(x))/2, where lpf(x) < gpf(x) are the least and the greatest prime factors of x: A020639 and A006530. %e A307108 105 = 3*7*5 is a term, 5 = (3+7) / 2. %e A307108 231 = 3*11*7 is a term, 7 = (3+11) / 2. %e A307108 3525 = 3*47*25 is a term, 25 = (3+47) / 2. %o A307108 (PARI) is(n) = my(f = factor(n)); omega(f) > 2 && (f[1, 1] * f[#f~, 1]) * (f[1, 1]+f[#f~, 1]) == n << 1 \\ _David A. Corneth_, Mar 25 2019 %Y A307108 Cf. A020639, A006530. %Y A307108 Cf. A262723 (a squarefree subsequence). %K A307108 nonn %O A307108 1,1 %A A307108 _Alex Ratushnyak_, Mar 25 2019