A061515 a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 3.

1, 4, 7, 10, 43, 76, 109, 4312, 7645, 10978, 43121011, 76454344, 109787677, 431210111091010, 7645434443124343, 10978767776457676, 43121011109101010978109109, 76454344431243434312101143124312, 109787677764576767645434476457645, 431210111091010109781091091097876771097810978

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.

Links

Table of n, a(n) for n=0..19.

Prog

(Python)
from itertools import accumulate, repeat
def f(n, _): return int("".join(str(int(d)+3) for d in str(n)))
def aupton(nn): return list(accumulate(repeat(1, nn+1), f))
print(aupton(19)) # Michael S. Branicky, Mar 19 2022

Crossrefs

Sequence in context: A088405 A100591 A135262 * A071084 A175833 A171964

Adjacent sequences: A061512 A061513 A061514 * A061516 A061517 A061518

Keyword

base,nonn

Author

Amarnath Murthy, May 08 2001

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001

a(17) corrected and a(18), a(19) by Georg Fischer, Mar 19 2022

Status

approved