|
Search: id:A065641
|
|
|
| A065641 |
|
Smallest number with persistence n for the sort-and-subtract-sequence. |
|
+0
1
|
|
| 1, 10, 60, 90, 101, 120, 380, 450, 505, 807, 1020, 1070, 1303, 1450, 3810, 10020, 10404, 10560, 16056, 16200, 18088, 20322, 20580, 35790, 79000, 80088, 90877, 243700, 279509, 330832, 374330, 380038, 903655, 1002404, 1005064, 1020828
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sort the digits of an integer and subtract the result from the original. Continue with the result until you reach 0. The sequence gives the least integer that needs n steps to reach 0.
|
|
EXAMPLE
|
60 is the smallest number that needs 3 steps to reach 0: 60 -> 60 - 06 = 54 -> 54 - 45 = 9 -> 9 - 9 = 0, hence a(3) = 60.
|
|
CROSSREFS
|
Sequence in context: A055714 A046762 A066290 this_sequence A121874 A076160 A004406
Adjacent sequences: A065638 A065639 A065640 this_sequence A065642 A065643 A065644
|
|
KEYWORD
|
nonn,base,nice
|
|
AUTHOR
|
Ulrich Schimke (ulrschimke(AT)aol.com), Dec 03 2001
|
|
|
Search completed in 0.002 seconds
|
