This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A169932 a(n) = 0+n in the arithmetic defined in A169918. 1


%S 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,

%T 20,20,20,20,30,30,30,30,30,30,30,30,30,30,40,40,40,40,40,40,40,40,40,

%U 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

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

%C Equivalently, set to zero the last (decimal) digit of n, i.e., subtract (n mod 10). The digit-wise addition defined in A169918 consists in 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

%F a(n) = [n/10]*10. - _M. F. Hasler_, Mar 25 2015

%o (PARI) A169932(n) = n\10*10 \\ _M. F. Hasler_, Mar 25 2015

%Y Cf. A169918.

%K nonn,base

%O 0,11

%A _David Applegate_, _Marc LeBrun_ and _N. J. A. Sloane_, Jul 20 2010

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 06:48 EDT 2019. Contains 322209 sequences. (Running on oeis4.)