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.

A169932 a(n) = 0+n in the arithmetic defined in A169918.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 70, 70, 70, 70, 70
Offset: 0

Views

Author

Keywords

Comments

Equivalently, set to zero the last (decimal) digit of n, i.e., subtract (n mod 10). The digit-wise addition defined in A169918 consists of multiplying the digits and taking this product modulo 10 for each digit, and "Blanks are ignored". Since 0 has only one digit, only the last digit of n is set to zero in that way. - M. F. Hasler, Mar 25 2015

Crossrefs

Cf. A169918.

Programs

Formula

a(n) = [n/10]*10. - M. F. Hasler, Mar 25 2015