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.

A033896 Sort then Add, a(1) =9.

Original entry on oeis.org

9, 18, 36, 72, 99, 198, 387, 765, 1332, 2565, 5121, 6246, 8712, 9990, 10989, 12888, 25776, 51453, 64908, 69597, 126396, 250065, 252621, 374877, 722655, 948222, 1170711, 1281888, 2410776, 2535453, 4870008, 4874796, 9342585, 11688174, 22834962, 45069651
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    A033896 := proc(n)
        option remember ;
        if n =1 then
            9;
        else
            A070196(procname(n-1)) ;
        end if;
    end proc:
    seq(A033896(n),n=1..100) ; # R. J. Mathar, Feb 03 2025
  • Mathematica
    NestList[FromDigits[Sort[IntegerDigits[#]]]+#&,9,40] (* Harvey P. Dale, Aug 19 2014 *)
  • Python
    from itertools import accumulate
    def sta(anm1, _): return anm1 + int("".join(sorted(str(anm1))))
    print(list(accumulate([9]*36, sta))) # Michael S. Branicky, Sep 18 2021