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.

A097004 Function A062402(x)=phi(sigma(x)) is iterated. Starting with 2^n, the n-th power of 2, a(n) is the count of distinct terms arising in trajectory; a(n)=t(n)+c(n)=t+c, where t is the number of transient terms, c is the number of recurrent terms [in the terminal cycle].

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 5, 5, 2, 4, 5, 11, 4, 4, 12, 17, 2, 8, 11, 14, 26, 11, 6, 80, 59, 100, 101, 95, 93, 60, 38, 55, 2
Offset: 0

Views

Author

Labos Elemer, Jul 21 2004

Keywords

Examples

			n=13: 2^n=8192, trajectory ={8192,8191,26208,[20440],.. }, a[13]=3+1=4 with 3 transients and one recurrent term.
		

Crossrefs

Programs

  • Mathematica
    EulerPhi[DivisorSigma[1, x]] itef[x_, len_] :=NestList[fs, x, len] Table[Length[Union[itef[2^w, 1000]]], {w, 1, 256}]