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.

A117879 First semiprime after e^n.

Original entry on oeis.org

4, 4, 9, 21, 55, 155, 407, 1099, 2981, 8105, 22033, 59881, 162757, 442417, 1202611, 3269021, 8886117, 24154953, 65659981, 178482301, 485165203, 1318815739, 3584912849, 9744803447, 26489122131, 72004899341, 195729609431
Offset: 0

Views

Author

Jonathan Vos Post, May 02 2006

Keywords

Comments

Semiprime analog of A074496 = first prime after e^n. Lim_{n->infinity} a(n+1)/a(n) = e. There are numbers where floor(e^n) is itself a semiprime, as with floor(e^6) = 403 = 13 * 31, floor(e^15) = 3269017 = 773 * 4229, floor(e^20) = 485165195 = 5 * 97033039, floor(e^22) = 3584912846 = 2 * 1792456423, floor(e^24) = 26489122129 = 103 * 257175943.

Crossrefs

Programs

  • Mathematica
    fsa[n_]:=Module[{i=1,c=Floor[E^n]},While[PrimeOmega[c+i]!=2,i++];c+i]; Array[fsa,30,0] (* Harvey P. Dale, Oct 18 2013 *)

Formula

a(n) = Smallest semiprime > e^n. Smallest semiprime > floor(e^n). a(n) = min{s > A000149(n) and s in A001358}.