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 A060265 #23 Dec 11 2024 23:41:12 %S A060265 3,5,7,7,11,13,13,17,19,19,23,23,23,29,31,31,31,37,37,41,43,43,47,47, %T A060265 47,53,53,53,59,61,61,61,67,67,71,73,73,73,79,79,83,83,83,89,89,89,89, %U A060265 97,97,101,103,103,107,109,109,113,113,113,113,113,113,113,127,127,131 %N A060265 Largest prime less than 2n. %C A060265 a(n) = A007917(2*n) = A255313(n-1,1) = A255316(n-1,1) = A006530(A255427(n)). - _Reinhard Zumkeller_, Feb 22 2015 %H A060265 Harry J. Smith, <a href="/A060265/b060265.txt">Table of n, a(n) for n = 2..1000</a> %p A060265 seq (prevprime(2*i+1), i=2..256); %t A060265 Table[NextPrime[2 n, -1], {n, 2, 66}] (* _Michael De Vlieger_, Jul 04 2016 *) %o A060265 (PARI) a(n) = precprime(2*n-1) \\ _Harry J. Smith_, Jul 03 2009 %o A060265 (Haskell) %o A060265 a060265 = a007917 . (* 2) -- _Reinhard Zumkeller_, Feb 22 2015 %Y A060265 Apart from initial term, same as A060308. %Y A060265 Cf. A020482, A049653, A088631, A007917, A005843, A255313. %K A060265 nonn,easy %O A060265 2,1 %A A060265 _Labos Elemer_, Mar 23 2001