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 A096015 #9 Feb 21 2024 08:18:41 %S A096015 1,3,3,3,5,5,7,3,3,3,11,5,13,3,3,3,17,5,19,3,3,3,23,5,5,3,3,3,29,7,31, %T A096015 3,3,3,5,5,37,3,3,3,41,5,43,3,3,3,47,5,7,3,3,3,53,5,5,3,3,3,59,7,61,3, %U A096015 3,3,5,5,67,3,3,3,71,5,73,3,3,3,7,5,79,3,3,3,83,5,5,3,3,3,89,7,7,3,3 %N A096015 a(n) = A096014(n) / 2. %C A096015 For n > 1, a(n) is the larger of the least prime dividing n and the least prime not dividing n. - _Peter Munn_, Feb 21 2024 %F A096015 a(n) = if n is odd then A020639(n) else A053669(n). %Y A096015 Cf. A020639, A053669, A096014. %K A096015 nonn,easy %O A096015 1,2 %A A096015 _Reinhard Zumkeller_, Jun 15 2004