OFFSET
1,2
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..1000
FORMULA
a(1) = 1; a(n+1) = a(n) + ceiling(log_10(a(n) + 1)) for n > 0. [corrected by Harry J. Smith, Sep 10 2009]
MATHEMATICA
NestList[#+IntegerLength[#]&, 1, 70] (* Harvey P. Dale, Jul 26 2011 *)
PROG
(PARI) { a=0; for (n=1, 1000, write("b064223.txt", n, " ", a+=#Str(a)) ) } \\ Harry J. Smith, Sep 10 2009
(Haskell)
a064223 n = a064223_list !! (n-1)
a064223_list = iterate (\x -> x + (fromIntegral $ a055642 x)) 1
-- Reinhard Zumkeller, Aug 02 2012
(Python)
from itertools import islice
def agen():
an = 1
while True: yield an; an += len(str(an))
print(list(islice(agen(), 67))) # Michael S. Branicky, Jul 26 2022
CROSSREFS
KEYWORD
nice,nonn,base
AUTHOR
Reinhard Zumkeller, Sep 21 2001
STATUS
approved