|
|
A334725
|
|
Irregular table read by row: the n-th row gives values of successively iterating phi, phi and sigma, starting with the initial value n, until the value 1 is reached. If 1 is never reached, row n contains n, -1.
|
|
4
|
|
|
1, 2, 1, 3, 2, 1, 4, 2, 1, 5, 4, 2, 3, 2, 1, 6, 2, 1, 7, 6, 2, 3, 2, 1, 8, 4, 2, 3, 2, 1, 9, 6, 2, 3, 2, 1, 10, 4, 2, 3, 2, 1, 11, 10, 4, 7, 6, 2, 3, 2, 1, 12, 4, 2, 3, 2, 1, 13, 12, 4, 7, 6, 2, 3, 2, 1, 14, 6, 2, 3, 2, 1, 15, 8, 4, 7, 6, 2, 3, 2, 1, 16, 8, 4, 7, 6, 2, 3, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
Table begins:
1
2, 1
3, 2, 1
4, 2, 1
5, 4, 2, 3, 2, 1
6, 2, 1
7, 6, 2, 3, 2, 1
8, 4, 2, 3, 2, 1
...
For n = 5, phi(5) = 4, phi(4) = 2, sigma(2) = 3, phi(3) = 2, and phi(2) = 1, therefore the 5th row is 5, 4, 2, 3, 2, 1.
|
|
MATHEMATICA
|
f[n_, i_] := If[Mod[i, 3] == 0, DivisorSigma[1, n], EulerPhi[n]]; g[n_] := Module[{i = 1, k = n, s = {}}, While[AppendTo[s, k]; k > 1, k = f[k, i++]]; s]; Array[g, 16] // Flatten
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|