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.

Showing 1-1 of 1 results.

A097006 Consider the function f(x)=sigma(phi(x))=A062402(x) iterated with initial value n!; a(n) is the path-length of trajectory.

Original entry on oeis.org

1, 1, 2, 2, 2, 5, 6, 5, 10, 10, 17, 49, 91
Offset: 0

Views

Author

Labos Elemer, Jul 22 2004

Keywords

Comments

The path length is the total number of transient and recurrent terms.
After 12000 iterations, f(13!) reaches 583880633503221176888439640142607059743547704176558111997560422400000.

Examples

			n=10: 10!=3628800; the trajectory is 3628800, 2972970, 2221560, 1915992, 1768767, 2877420, [1965840, 2227680, 1310680, 1591200, 1277874, 1307124, 1110488, 2010960, 1488032, 1981496, 2239920], [1965840, ...], ...; thus a(10)=17, with 6 transient and 11 recurrent states.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := DivisorSigma[1, EulerPhi[n]]; g[n_] := Length[ NestWhileList[ f, n, UnsameQ, All]] - 1; Table[ g[n! ], {n, 12}] (* Robert G. Wilson v, Jul 23 2004 *)

Extensions

Edited by Robert G. Wilson v, Jul 23 2004
Showing 1-1 of 1 results.