

A103168


a(n) = remainder when (n written backwards) is divided by n.


3



0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 9, 5, 13, 6, 13, 3, 9, 15, 2, 12, 0, 9, 18, 2, 10, 18, 26, 5, 3, 13, 23, 0, 9, 18, 27, 36, 7, 15, 4, 14, 24, 34, 0, 9, 18, 27, 36, 45, 5, 15, 25, 35, 45, 0, 9, 18, 27, 36, 6, 16, 26, 36, 46, 56, 0, 9, 18, 27, 7, 17, 27, 37, 47, 57, 67, 0, 9, 18, 8, 18, 28, 38
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,12


LINKS

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


EXAMPLE

a(n)=0 for palindromic numbers.


MATHEMATICA

rd[x_]:=FromDigits[Reverse[IntegerDigits[x]]] Table[Mod[rd[n], n], {n, 1, 256}]


PROG

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


CROSSREFS

Cf. A071955, A103166A103169, A002113, A071590.
Sequence in context: A078086 A337171 A061467 * A298584 A238475 A180878
Adjacent sequences: A103165 A103166 A103167 * A103169 A103170 A103171


KEYWORD

base,nonn


AUTHOR

Labos Elemer, Jan 28 2005


EXTENSIONS

Definition corrected by N. J. A. Sloane, Jul 14 2007


STATUS

approved



