A071955 a(n) = remainder when n is reduced mod reverse(n).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 13, 14, 15, 16, 17, 18, 19, 0, 9, 0, 23, 24, 25, 26, 27, 28, 29, 0, 5, 9, 0, 34, 35, 36, 37, 38, 39, 0, 13, 18, 9, 0, 45, 46, 47, 48, 49, 0, 6, 2, 18, 9, 0, 56, 57, 58, 59, 0, 13, 10, 27, 18, 9, 0, 67, 68, 69, 0, 3, 18, 36, 27, 18, 9, 0, 78, 79, 0, 9

Offset: 1

Author

Joseph L. Pe, Jun 16 2002

Keywords

• base
• nonn

Comments

a(n)=0 if n is palindromic - Labos Elemer, Jan 28 2005

Examples

			a(85) = 85 mod 58 = 27.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A002113, A071590, A103164, A103168.

Programs

Mathematica

Table[Mod[n, FromDigits[Reverse[IntegerDigits[n]]]], {n, 1, 256}] (* Labos Elemer, Jan 28 2005 *)
Table[Mod[n, FromDigits[Reverse[IntegerDigits[n]]]], {n, 1, 100}]

PARI

a(n, base=10) = my (r=fromdigits(Vecrev(digits(n, base)), base)); n%r \\ Rémy Sigrist, Apr 05 2020

Extensions

Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jul 14 2007