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 A365710 #45 Jan 06 2024 10:28:30 %S A365710 3,3,5,3,7,3,5,11,5,3,5,13,3,7,3,7,17,3,5,19,5,3,11,3,23,3,7,11,5,13, %T A365710 3,7,29,13,3,31,3,3,5,17,5,3,7,37,3,19,17,3,5,3,41,3,19,43,7,11,3,23, %U A365710 47,7,3,7,3,5,3,23,13,53,3,5,7,5,3,29,3,59,3,11 %N A365710 a(n) = second smallest distinct prime factor of A126706(n). %C A365710 Since omega(A126706(n)) = A001221(A126706(n)) > 1, and since A126706 is infinite, a(n) exists for all n. %F A365710 a(n) = A119288(A126706(n)) > 2. %e A365710 Let b(n) = A126706(n). %e A365710 a(1) = 3 since b(1) = 12 = 2^2 * 3. %e A365710 a(2) = 3 since b(2) = 18 = 2 * 3^2. %e A365710 a(3) = 5 since b(3) = 20 = 2^2 * 5, etc. %t A365710 FactorInteger[#][[2, 1]] & /@ Select[Range[250], PrimeOmega[#] > PrimeNu[#] > 1 &] %Y A365710 Cf. A119288, A126706. %K A365710 nonn,easy %O A365710 1,1 %A A365710 _Michael De Vlieger_, Jan 05 2024