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.

A087976 a(n) = A001221(A025586(n)), the number of distinct prime-factors of maximal term in 3x+1 iteration list started at n.

Original entry on oeis.org

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

Views

Author

Labos Elemer, Sep 25 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Collatz[a0_Integer, maxits_: 1000] := NestWhileList[If[EvenQ[#], #/2, 3 # + 1] &, a0, Unequal[#, 1, -1, -10, -34] &, 1, maxits]; (*Collatz[n] function definition by Eric Weisstein*) A025586[m_] :=
    Flatten[Table[Take[Sort[Collatz[n], Greater], 1], {n, m}]];
    PrimeNu[A025586[100]] (* G. C. Greubel, Apr 24 2017 *)