cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A033864 Sorted number reached from A033863(n) by Sort-then-add.

Original entry on oeis.org

1, 11, 233, 233, 2233, 1336, 1446, 2477, 2477, 12888, 12888, 12888, 44677, 115588, 67788, 67788, 67788, 67788, 2334455, 2255666, 2255666, 2444477, 2444477, 1122688, 1122688, 1125555, 1125555, 1125555, 11337888, 222224499, 22244488
Offset: 0

Views

Author

David W. Wilson

Keywords

A033908 Least number of Sort-then-add persistence n.

Original entry on oeis.org

0, 10, 65, 64, 175, 98, 240, 325, 302, 387, 198, 180, 550, 806, 855, 486, 351, 315, 944, 2428, 2204, 3172, 1793, 1316, 937, 2775, 1815, 1461, 2541, 9378, 13327, 9638, 8149, 6581, 46965, 23487, 12198, 10599, 10920, 52345, 48788, 180666, 174870, 291119
Offset: 0

Views

Author

David W. Wilson

Keywords

Crossrefs

Essentially same as A033863. Cf. A033909.

A033861 Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)).

Original entry on oeis.org

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
Offset: 1

Views

Author

David W. Wilson

Keywords

Comments

316 is almost certainly the least starter not leading to a sorted element.

Examples

			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

Links

Crossrefs

Cf. A033860, A033862, A033863.

Programs

  • Mathematica
    NestList[#+FromDigits[Sort[IntegerDigits[#]]]&,316,40] (* Harvey P. Dale, Jan 28 2013 *)
  • Python
    A033861_list = [316]
for i in range(100):
    x = A033861_list[-1]
    A033861_list.append(x+int(''.join(sorted(str(x))))) # Chai Wah Wu, Feb 07 2020

A033909 Number of Sort then Add steps needed to reach a sorted number, or -1 if never reach sorted number.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 3, 2, 0, 0, 0, 0, 1, 1, 1, 3, 2, 2, 2, 0, 0, 0
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Examples

			64 -> 64+46=110 -> 110+11=121 -> 121+112 = 233, taking 3 steps to reach a sorted number, so a(64)=3.

Crossrefs

Cf. A033863, A033908.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.