|
|
A033861
|
|
Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)).
|
|
2
|
|
|
316, 452, 697, 1376, 2743, 5090, 5149, 6608, 7276, 9953, 13552, 25907, 28486, 53174, 66631, 80297, 83086, 86774, 133552, 256907, 282586, 508274, 532852, 756410, 770977, 848756, 1305544, 1439999, 2789998, 5578997, 11156896
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
316 is almost certainly the least starter not leading to a sorted element.
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) = 316, a(2) = a(1)+sort(a(1)) = 316 + 136 = 452, a(3) = a(2) + sort(a(2)) = 452 + 245 = 697. - Indranil Ghosh, Jan 29 2017
|
|
MATHEMATICA
|
NestList[#+FromDigits[Sort[IntegerDigits[#]]]&, 316, 40] (* Harvey P. Dale, Jan 28 2013 *)
|
|
PROG
|
(Python)
for i in range(100):
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|