|
Search: id:A099648
|
|
|
| A099648 |
|
Largest term arising in complete-iteration-list [both transient and cycle] when f[x]=A003132[x] is iterated, i.e. if digit-squares of iterate added repeatedly until steady state [= either cycle or fixed point] was reached. |
|
+0
3
|
|
| 1, 145, 145, 145, 145, 145, 130, 145, 145, 10, 145, 145, 13, 145, 145, 145, 145, 145, 100, 145, 145, 145, 23, 145, 145, 145, 145, 100, 145, 145, 31, 32, 145, 145, 145, 145, 145, 145, 145, 145, 145, 145, 145, 44, 145, 145, 145, 145, 130, 145, 145, 145, 145, 145
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
n=2: list={2,4,16,37,58,89,145,42,20,4,16,37,58,..} a[2]=max[list]=145;
For n<145, max > initial value except few cases. See A099649.
|
|
MATHEMATICA
|
ed[x_] :=IntegerDigits[x]; func[x_] :=Apply[Plus, ed[x]^2]; itef[x_, ho_] :=NestList[id2, x, 100]; Table[Max[Union[itef[w, 100]]], {w, 1, 256}]
|
|
CROSSREFS
|
Cf. A003132, A031176, A099646, A099649.
Adjacent sequences: A099645 A099646 A099647 this_sequence A099649 A099650 A099651
Sequence in context: A003837 A013863 A126843 this_sequence A043652 A051414 A094613
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 12 2004
|
|
|
Search completed in 0.002 seconds
|
