A095221 (Concatenation 1,2,3,...,n) mod n.

0, 0, 0, 2, 0, 0, 5, 6, 0, 0, 4, 0, 4, 4, 0, 12, 15, 0, 16, 0, 3, 4, 6, 12, 0, 16, 0, 8, 3, 0, 18, 28, 15, 16, 25, 0, 14, 10, 33, 20, 27, 24, 27, 4, 0, 36, 35, 12, 29, 0, 48, 4, 14, 0, 15, 4, 18, 28, 3, 0, 28, 60, 45, 60, 55, 48, 13, 52, 0, 50, 14, 36, 12, 72, 0, 20, 4, 72, 74, 60, 54, 24, 65

Offset

1,4

Links

Michael S. Branicky, Table of n, a(n) for n = 1..10000

Formula

a(n) = A007908(n) mod n. - Michel Marcus, Nov 21 2022

Example

a(4) = 1234 mod 4 = 2.

Prog

(Python)
from itertools import count, islice
def agen():
    s = "0"
    for n in count(1): s += str(n); yield int(s)%n
print(list(islice(agen(), 83))) # Michael S. Branicky, Nov 21 2022

Crossrefs

Cf. A007908, A094151.

Sequence in context: A358304 A285192 A278177 * A078112 A281190 A275619

Adjacent sequences: A095218 A095219 A095220 * A095222 A095223 A095224

Keyword

base,nonn,easy

Author

Amarnath Murthy, Jun 10 2004

Extensions

More terms from John W. Layman, Jul 29 2005

Status

approved