The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A169932 a(n) = 0+n in the arithmetic defined in A169918. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 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 LINKS FORMULA a(n) = [n/10]*10. - M. F. Hasler, Mar 25 2015 PROG (PARI) A169932(n) = n\10*10 \\ M. F. Hasler, Mar 25 2015 CROSSREFS Cf. A169918. Sequence in context: A109751 A160941 A070565 * A245403 A091837 A316650 Adjacent sequences:  A169929 A169930 A169931 * A169933 A169934 A169935 KEYWORD nonn,base AUTHOR David Applegate, Marc LeBrun and N. J. A. Sloane, Jul 20 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 23:00 EST 2020. Contains 332113 sequences. (Running on oeis4.)