|
Search: id:A099649
|
|
|
| A099649 |
|
Solutions to A099648[x]>x. That is when the largest term in iteration of A003132() function strictly exceeds the initial value. |
|
+0
3
|
|
| 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Above 144 no more (only 130) terms I could encounter. Is this sequence finite[and full]?
|
|
EXAMPLE
|
n=7: list={7,49,97,130,10,1,1,1,1,1,1,1,..} iv=7<max=130.So 7 is here.
numbers <145 are here except {1,10,13,23,31,32,44,100,103,109,129,130,133,139}.
n=32: list={32,13,10,1,1,..}. So 32 is not here.
|
|
MATHEMATICA
|
ed[x_] :=IntegerDigits[x]; func[x_] :=Apply[Plus, ed[x]^2]; itef[x_, ho_] :=NestList[id2, x, 100]; ta={{0}}; Do[s=Max[Union[itef[w, 100]]]; If[Greater[s, w], Print[w]; ta=Append[ta, w]], {w, 1, 10000000}]; Delete[ta, 1]
|
|
CROSSREFS
|
Cf. A003132, A031176, A099646, A099649.
Sequence in context: A126969 A127274 A129946 this_sequence A033108 A049811 A124097
Adjacent sequences: A099646 A099647 A099648 this_sequence A099650 A099651 A099652
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 12 2004
|
|
|
Search completed in 0.002 seconds
|
