|
Search: id:A166121
|
|
|
| A166121 |
|
Let dsf(n) = n_1^{n_1}+n_2^{n_2}+n_3^{n_3} + n_m^{n_m}, where {n_1,n_2,n_3,...n_m} is the list of the digits of an integer n. dsf(791621579) =776537851 and dsf(776537851) = 19300779,...,dsf(824599) = 791621579,.. in this way this 11 numbers make a loop for the function dsf. |
|
+0
3
|
|
| 791621579, 776537851, 19300779, 776488094, 422669176, 388384265, 50381743, 17604196, 388337603, 34424740, 824599, 791621579, 776537851, 19300779, 776488094, 422669176, 388384265, 50381743, 17604196, 388337603, 34424740
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
In fact there are only 8 loops in the whole non-negative integers for the dsf-function that we defined. We have discovered this fact with the calculation by Mathematica and other general purpose languages.
|
|
LINKS
|
Ryohei Miyadera, Curious Properties of an Iterative Process,Mathsource, Wolfram Library Archive
|
|
FORMULA
|
Let dsf(n) = n_1^{n_1}+n_2^{n_2}+n_3^{n_3} + n_m^{n_m}, where {n_1,n_2,n_3,...n_m} is the list of the digits of an integer n. By applying the function dsf to 791621579 we can get a loop of the length of 11.
|
|
EXAMPLE
|
This is an reiterative process that starts with 791621579.
|
|
MATHEMATICA
|
dsf[n_] := Block[{m = n, t}, t = IntegerDigits[m]; Sum[Max[1, t[[k]]]^t[[k]], {k, Length[t]}]]; NestList[dsf, 791621579, 22]
|
|
CROSSREFS
|
Cf. A165942, A166024, A166072
Sequence in context: A118876 A157788 A058420 this_sequence A046186 A166227 A104829
Adjacent sequences: A166118 A166119 A166120 this_sequence A166122 A166123 A166124
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Ryohei Miyadera, Takuma Nakaoka and Koichiro Nishimura. (Miyadera127(AT)aol.com), Oct 07 2009
|
|
|
Search completed in 0.002 seconds
|
