cp's OEIS Frontend

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.

A040014 Number of primes < e^n.

This page as a plain text file.
%I A040014 #75 Sep 30 2020 03:54:03
%S A040014 0,1,4,8,16,34,79,183,429,1019,2466,6048,14912,37128,93117,234855,
%T A040014 595341,1516233,3877186,9950346,25614562,66124777,171141897,443963543,
%U A040014 1154106844,3005936865,7842921261,20496470801,53645077679,140599114669,368973074565,969455391690,2550043255883
%N A040014 Number of primes < e^n.
%C A040014 a(n) = A000720(A000149(n)). - _Reinhard Zumkeller_, Mar 17 2015
%H A040014 David Baugh, <a href="/A040014/b040014.txt">Table of n, a(n) for n = 0..59</a> (terms n = 0..39 from Giovanni Resta, terms n = 40..59 found using Kim Walisch's primecount program).
%H A040014 <a href="/index/Pri#primepop">Index entries for sequences related to numbers of primes in various ranges</a>
%t A040014 Table[PrimePi[Exp[n]], {n, 0, 33}]
%o A040014 (Haskell)
%o A040014 a040014 = a000720 . a000149  -- _Reinhard Zumkeller_, Mar 17 2015
%Y A040014 Cf. A006880 and A007053.
%Y A040014 Cf. A000720, A000149.
%K A040014 nonn
%O A040014 0,3
%A A040014 _Jud McCranie_
%E A040014 a(27)-a(29) from _Robert G. Wilson v_, Jun 09 2000
%E A040014 a(30)-a(32) from _Seiichi Manyama_, May 04 2016