|
%I #15 Apr 05 2020 11:48:48
%S 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,
%T 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,
%U 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
%N a(n) = remainder when n is reduced mod reverse(n).
%C a(n)=0 if n is palindromic - _Labos Elemer_, Jan 28 2005
%H Rémy Sigrist, <a href="/A071955/b071955.txt">Table of n, a(n) for n = 1..10000</a>
%e a(85) = 85 mod 58 = 27.
%t Table[Mod[n, FromDigits[Reverse[IntegerDigits[n]]]], {n, 1, 256}] (* _Labos Elemer_, Jan 28 2005 *)
%t Table[Mod[n, FromDigits[Reverse[IntegerDigits[n]]]], {n, 1, 100}]
%o (PARI) a(n, base=10) = my (r=fromdigits(Vecrev(digits(n, base)), base)); n%r \\ _Rémy Sigrist_, Apr 05 2020
%Y Cf. A002113, A071590, A103164, A103168.
%K base,nonn
%O 1,12
%A _Joseph L. Pe_, Jun 16 2002
%E Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jul 14 2007
|
