Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #30 Nov 02 2013 19:30:05
%S 2,3,19,23,31,43,59,61,73,83,103,107,109,113,151,163,179,181,197,199,
%T 233,241,269,271,277,281,283,313,317,349,353,379,383,409,421,433,443,
%U 449,461,463,503,509,523,571,577,593,599,601,617,619,643,647,659,661,677
%N Primes in A217689.
%C Apart from the initial 2, the odd terms of A217689. - _M. F. Hasler_, Oct 19 2012
%F If A(n) is the number of terms not exceeding n, then heuristically A(n) is equivalent to log(2)*pi(n), as n tends to infinity. Practically, an approximation of A(n)is given by the expression n*log(2)/log(n*log(n)).
%Y Cf. A217689.
%K nonn
%O 1,1
%A _Vladimir Shevelev_, Oct 11 2012