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.

A114575 Number of distinct prime factors of floor(e^n).

Original entry on oeis.org

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

Views

Author

Stefan Steinerberger, Feb 17 2006

Keywords

Examples

			floor(e^3) = floor(20.08553) = 20. 20 has two distinct prime factors (2 and 5), therefore a(3) = 2.
		

Crossrefs

Cf. A001113 [decimal expansion of e].

Programs

  • Mathematica
    Table[Length[FactorInteger[Floor[E^n]]], {n, 1, 80}]
    PrimeNu[Floor[E^Range[80]]] (* Harvey P. Dale, Jul 21 2013 *)