A059632 Carryless product 11 X n base 10.

0, 11, 22, 33, 44, 55, 66, 77, 88, 99, 110, 121, 132, 143, 154, 165, 176, 187, 198, 109, 220, 231, 242, 253, 264, 275, 286, 297, 208, 219, 330, 341, 352, 363, 374, 385, 396, 307, 318, 329, 440, 451, 462, 473, 484, 495, 406, 417, 428, 439, 550, 561, 572, 583

Offset: 0

Author

Henry Bottomley, Feb 19 2001

Keywords

• base
• nonn

Comments

a(n) <= 11*n; a(m) = 11*m iff m is a term of A039691. - Reinhard Zumkeller, Jul 05 2014

Examples

			a(19)=109 since we have 11 X 19 = carryless sum of 100, 90, 10 and 9 =109
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
• David Applegate, Marc LeBrun and N. J. A. Sloane, Carryless Arithmetic (I): The Mod 10 Version.

Crossrefs

Cf. A001477 for carryless 1 X n, A004520 for carryless 2 X 10 base 10, A055120 for carryless 9 X n, A008592 for carryless 10 X n.

Cf. A048724 carryless 3Xn in base 2, A242399 carryless 4Xn in base 3.

Cf. A008593.

Programs

Haskell

a059632 n = foldl (\v d -> 10 * v + d) 0 $
                  map (flip mod 10) $ zipWith (+) ([0] ++ ds) (ds ++ [0])
            where ds = map (read . return) $ show n
-- Reinhard Zumkeller, Jul 05 2014