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 A237285 #15 Mar 02 2014 23:06:39 %S A237285 2,3,5,7,11,17,23,29,37,47,59,71,89,107,127,149,173,199,227,257,293, %T A237285 331,373,419,467,521,577,641,709,787,859,937,1019,1103,1193,1289,1399, %U A237285 1511,1621,1741,1867,1997,2129,2267,2411,2579,2741,2909,3079,3257,3449 %N A237285 Lexicographically earliest sequence of primes such that a(n)*n / sum(i=1..n, a(n) ) is strictly increasing. %C A237285 If we replace in name of sequence: %C A237285 primes -> nonprime numbers, then a(n) = A103517(n-1), %C A237285 primes -> composite numbers, then a(n) = A103517(n), %C A237285 primes -> noncomposite numbers, then a(n) = A237288(n), %C A237285 primes -> natural numbers, then a(n) = A000027(n). %e A237285 For n=6: prime a(6) = 17 > a(5) = 11 is the smallest prime such that (6*17 / 45) > (5*11 / 28); a(6) is not 13 because (6*13 / (45-4)) < (5*11 / 28). %Y A237285 Cf. A000040 (primes). %K A237285 nonn %O A237285 1,1 %A A237285 _Jaroslav Krizek_, Feb 24 2014