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.

A086411 Greatest prime factor of 3-smooth numbers.

Original entry on oeis.org

1, 2, 3, 2, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 18 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Reap[Do[p = FactorInteger[n][[-1, 1]]; If[p < 5, Sow[p]], {n, 1, 2*10^5}] ][[2, 1]] (* Jean-François Alcover, Dec 17 2017 *)

Formula

a(n) = A006530(A003586(n)).
A086410(n) <= a(n) <= 3.
a(A033845(n)) = A086410(A033845(n))+1; a(A006899(n)) = A086410(A006899(n)). - Reinhard Zumkeller, Sep 25 2008
Conjecture: a(n) = A049237(n+1) for n>1. - R. J. Mathar, Jun 06 2024