login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033860 Sort-then-add sequence: a(n+1) = a(n) + sort(a(n)). 17
1, 2, 4, 8, 16, 32, 55, 110, 121, 233, 466, 932, 1171, 2288, 4576, 9143, 10492, 11741, 22888, 45776, 91453, 104912, 116161, 227327, 449704, 494183, 628672, 855350, 890908, 899807, 978706, 1046495, 1191064, 1302533, 1425868, 2671556, 3927223 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

a(n+1) = A070196(a(n)). - Reinhard Zumkeller, Apr 03 2015

EXAMPLE

After 9143 the next term is 9143 + 1349 = 10492.

MATHEMATICA

NestList[#+FromDigits[Sort[IntegerDigits[#]]]&, 1, 40] (* Harvey P. Dale, Jul 24 2016 *)

PROG

(Haskell)

a033860 n = a033860_list !! (n-1)

a033860_list = iterate a070196 1

-- Reinhard Zumkeller, Apr 03 2015

CROSSREFS

Cf. A070196, A004185.

Sequence in context: A175951 A072207 A176718 * A231388 A229614 A230216

Adjacent sequences:  A033857 A033858 A033859 * A033861 A033862 A033863

KEYWORD

nonn,base

AUTHOR

David W. Wilson

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 00:12 EST 2018. Contains 317332 sequences. (Running on oeis4.)