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 A090417 #12 Aug 27 2025 10:55:53
%S A090417 7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,
%T A090417 103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,
%U A090417 193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
%N A090417 Primes of the form floor(2*Pi*n/(e*log(n))).
%C A090417 An entropy power of white noise function with N=1/log(n).
%C A090417 Function is based on asymptotic form of distribution: PrimePi[n]--> n/log(n) Function misses the first three primes {2,3,5}, but is pretty good after that.
%C A090417 It is easy to see due to the slow growth of the function that the sequence is precisely the primes greater than 5. [_Charles R Greathouse IV_, Aug 21 2011]
%D A090417 C. E. Shannon, The Mathematical Theory of Communication, page 93
%t A090417 digits=5*200 f[n_]=Floor[2*Pi*n/(E*Log[n])] a=Delete[Union[Table[If [PrimeQ[f[n]]==True, f[n], 0], {n, 2, digits}]], 1]
%o A090417 (PARI) a(n)=prime(n+3) \\ _Charles R Greathouse IV_, Aug 21 2011
%Y A090417 Cf. A004139.
%K A090417 nonn,easy,changed
%O A090417 1,1
%A A090417 _Roger L. Bagula_, Jan 31 2004