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 A125527 #31 Feb 16 2025 08:33:04
%S A125527 0,1,2,6,10,22,42,82,157,304,589,1124,2186,4192,8110,15658,30253,
%T A125527 58546,113307,219759,426180,827702,1608668,3129211,6091437,11868599,
%U A125527 23140878,45150717,88157689,172235073,336717854,658662065,1289149627,2524532330
%N A125527 Number of semiprimes <= 2^n.
%H A125527 Robert G. Wilson v, <a href="/A125527/b125527.txt">Table of n, a(n) for n = 1..63</a> (using data from A120033, terms n=48, 50..57 from Dana Jacobsen)
%H A125527 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Semiprime.html">Semiprime</a>.
%F A125527 a(n) = A072000(2^n). - _R. J. Mathar_, Aug 26 2011
%t A125527 SemiPrimePi[n_] := Sum[ PrimePi[ n/Prime@i] - i + 1, {i, PrimePi@ Sqrt@n}]; Table[ SemiPrimePi[2^n], {n, 47}]
%o A125527 (PARI) a(n)=my(s,i,N=2^n); forprime(p=2, sqrtint(N), s+=primepi(N\p); i++); s - i * (i-1)/2 \\ _Charles R Greathouse IV_, May 12 2013
%o A125527 (Perl) use ntheory ":all"; print "$_ ",semiprime_count(1 << $_),"\n" for 1..48; # _Dana Jacobsen_, Sep 10 2018
%Y A125527 Cf. A126279, A066265, A007053, A120033, A127396.
%K A125527 nonn
%O A125527 1,3
%A A125527 _Robert G. Wilson v_, Dec 29 2006