login

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”).

A114575
Number of distinct prime factors of floor(e^n).
0
1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4, 3, 2, 4, 2, 4, 4, 1, 5, 2, 3, 2, 4, 2, 3, 3, 3, 4, 3, 3, 2, 5, 5, 3, 7, 4, 3, 3, 4, 5, 2, 5, 4, 3, 6, 5, 3, 4, 4, 1, 4, 5, 5, 6, 4, 5, 6, 3, 4, 2, 4, 5, 7, 9, 3, 6, 7, 8, 5, 3, 5, 7, 5, 5, 7, 3, 5, 6, 6, 6
OFFSET
0,3
EXAMPLE
floor(e^3) = floor(20.08553) = 20. 20 has two distinct prime factors (2 and 5), therefore a(3) = 2.
MATHEMATICA
Table[Length[FactorInteger[Floor[E^n]]], {n, 1, 80}]
PrimeNu[Floor[E^Range[80]]] (* Harvey P. Dale, Jul 21 2013 *)
CROSSREFS
Cf. A001113 [decimal expansion of e].
Sequence in context: A025809 A204591 A279220 * A131849 A362344 A244479
KEYWORD
nonn
AUTHOR
STATUS
approved