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 A250621 #21 Nov 12 2024 08:18:31
%S A250621 0,2,4,7,11,15,19,23,28,33,37,43,48,52,57,63,69,73,79,85,90,96,101,
%T A250621 107,114,119,125,130,136,141,150,156,162,167,175,180,187,193,199,206,
%U A250621 212,218,225,231,237,243,251,259,265,271,278,284,290,298,305,312,318,324,331
%N A250621 a(n) = floor(n*log(prime(n))).
%C A250621 From n < prime(n), n >= 1 follows that n*log(n) < prime(n) < n*log(prime(n)), n >= 4. This inequality is included in the prime number theorem PNT.
%e A250621 For n = 1, prime(1) = 2, floor(1*0.69... = 0.69...) = 0 ;
%e A250621 For n = 25, prime(25) = 97, floor(25*4.57... = 114.36...) = 114.
%t A250621 Table[Floor[n Log[Prime[n]]],{n,60}] (* _Harvey P. Dale_, Aug 13 2019 *)
%o A250621 (PARI) vector(100,n,floor(n*log(prime(n)))) \\ _Derek Orr_, Nov 28 2014
%Y A250621 Cf. A050504 (floor(n*log(n))), A086861 (floor(prime(n)/log(prime(n)))), A085581 (floor(prime(n)/log(n))), A050504 (integer part of n*log(n)), A050503 (nearest integer to n*log(n)), A050502 (ceiling of n*log(n)).
%K A250621 nonn,easy
%O A250621 1,2
%A A250621 _Freimut Marschner_, Nov 26 2014