login
A061518
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 5.
0
0, 5, 10, 65, 1110, 6665, 11111110, 66666665, 1111111111111110, 6666666666666665, 11111111111111111111111111111110, 66666666666666666666666666666665, 1111111111111111111111111111111111111111111111111111111111111110
OFFSET
0,2
COMMENTS
In A061511-A061522, A061746-A061750 when the incremented digit exceeds 9 it is written as a 2-digit string. So 9+1 becomes the 2-digit string 10, etc.
PROG
(Python)
from itertools import accumulate, repeat
def f(n, _): return int("".join(str(int(d)+5) for d in str(n)))
def aupton(nn): return list(accumulate(repeat(0, nn+1), f))
print(aupton(12)) # Michael S. Branicky, Mar 19 2022
CROSSREFS
Sequence in context: A062162 A062848 A054884 * A218540 A174937 A180851
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, May 08 2001
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001
a(3) and following corrected and formula removed by Georg Fischer, Mar 19 2022
STATUS
approved