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.

A045646 Alternative version of A006050.

Original entry on oeis.org

1, 10, 19, 199, 19999999999999999999999
Offset: 0

Views

Author

Keywords

Comments

This is also the smallest n such that digit sum of n = previous term. - Dominick Cancilla, Aug 09 2010

References

  • H. J. Hindin, The additive persistence of a number, J. Rec. Math., 7 (No. 2, 1974), 134-135.

Crossrefs

Programs

  • Mathematica
    Join[{1},NestList[2*10^((#-1)/9)-1&,10,3]] (* Harvey P. Dale, Sep 20 2011 *)

Formula

For n > 1, a(n) = 2*10^((a(n-1)-1)/9) - 1.

Extensions

Next term is 1 followed by 2222222222222222222222 9s.