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.

A105466 Number of irregular primes less than or equal to the m-th prime, where m = floor(exp(n)).

This page as a plain text file.
%I A105466 #8 Mar 05 2019 08:57:15
%S A105466 0,0,3,9,58,160,440,1166,3202,8656,23475,64194,174557,473592,1286383,
%T A105466 3495241,9501807,25833916
%N A105466 Number of irregular primes less than or equal to the m-th prime, where m = floor(exp(n)).
%C A105466 Limit_{n->inf.} a(n)/e^n = 1-e^(-1/2).
%t A105466 ip={ the list of irregular primes to 12 million }; Table[ Length[ Select[ip, # < Prime[Floor[E^n]] &]], {n, 10}]
%Y A105466 Cf. A055739, A105457, A105461.
%K A105466 hard,nonn,more
%O A105466 1,3
%A A105466 _Robert G. Wilson v_, Apr 07 2005
%E A105466 Definition clarified by _N. J. A. Sloane_, Jan 19 2009
%E A105466 Data corrected and a(11)-a(18) added by _Amiram Eldar_, Mar 05 2019