login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085770 Number of odd semiprimes < 10^n. Number of terms of A046315 < 10^n. 1
1, 19, 204, 1956, 18245, 168497, 1555811, 14426124, 134432669, 1258822220, 11840335764, 111817881036, 1059796387004, 10076978543513, 96091983644261, 918679875630905 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

a(1)=1 because A046315(1)=9=3*3 is the only odd semiprime < 10^1,

a(2)=19 because there are 19 terms of A046315 < 10^2.

MATHEMATICA

OddSemiPrimePi[n_] := Sum[ PrimePi[n/Prime@i] - i + 1, {i, 2, PrimePi@ Sqrt@ n}]; Table[ OddSemiPrimePi[10^n], {n, 14}] (* Robert G. Wilson v *)

CROSSREFS

Cf. A046315 (odd numbers divisible by exactly 2 primes), A066265 (number of semiprimes < 10^n).

Sequence in context: A160452 A113596 A155670 * A002501 A125407 A023017

Adjacent sequences:  A085767 A085768 A085769 * A085771 A085772 A085773

KEYWORD

more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Jul 22 2003

EXTENSIONS

a(10)-a(14) from Robert G. Wilson v (rgwv(at)rgwv.com), Feb 02 2006

a(15)-a(16) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Mar 18 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 23:08 EST 2012. Contains 206085 sequences.