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.

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

Original entry on oeis.org

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

Views

Author

Amarnath Murthy, Jun 10 2004

Keywords

Examples

			a(4) = 1234 mod 4 = 2.
		

Crossrefs

Programs

  • 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

Formula

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

Extensions

More terms from John W. Layman, Jul 29 2005