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.

A288636 Height of power-tower factorization of n. Row lengths of A278028.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Jun 12 2017

Keywords

Comments

After a(1)=0 this sequence has many terms equal to A089723. It first differs at a(64)=2, A089723(64)=4.
First positions of a(n) = {0, 1, 2, 3, 4} are n = {1, 2, 4, 16, 65536}. - Michael De Vlieger, Nov 24 2017

Crossrefs

Programs

  • Mathematica
    a[n_] := If[n == 1, 0, 1+a[GCD @@ FactorInteger[n][[All, 2]]]];
    Array[a,100]