The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061467 Remainder when the larger of n and its reverse is divided by the smaller. 3
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 5, 13, 6, 13, 3, 9, 15, 0, 9, 0, 9, 18, 2, 10, 18, 26, 5, 0, 5, 9, 0, 9, 18, 27, 36, 7, 15, 0, 13, 18, 9, 0, 9, 18, 27, 36, 45, 0, 6, 2, 18, 9, 0, 9, 18, 27, 36, 0, 13, 10, 27, 18, 9, 0, 9, 18, 27, 0, 3, 18, 36, 27, 18, 9, 0, 9, 18, 0, 9, 26, 7, 36, 27 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,13 COMMENTS a(n)=0 if n is in A002113, A008919 or A118959. - Robert Israel, Jul 18 2019 LINKS Harry J. Smith, Table of n, a(n) for n = 0..1000 EXAMPLE a(12)=9 since 21/12 = 1 with remainder 9. MAPLE T:=proc(n) local i, x; x:=convert(n, base, 10); add(x[-i]*10^(i-1), i=1..nops(x)) end: seq(max(n, T(n)) mod min(n, T(n)), n=1..85); # Paolo P. Lava, Jul 18 2019 MATHEMATICA l := {} For[i = 1, i < 100, i++, x := FromDigits[Reverse[IntegerDigits[i]]]; If[x >= i, AppendTo[l, Mod[x, i]], AppendTo[l, Mod[i, x]]]] l (* Jake Foster, Jun 05 2008 *) rln[n_]:=Module[{r=IntegerReverse[n]}, If[r>n, Mod[r, n], Mod[n, r]]]; Join[ {0}, Array[rln, 90]] (* The program uses the IntegerReverse function from Mathematica version 10 *) (* Harvey P. Dale, Apr 03 2016 *) PROG (PARI) { for (n=0, 1000, x=n; r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); p=max(n, r); q=min(n, r); write("b061467.txt", n, " ", p%q) ) } \\ Harry J. Smith, Jul 23 2009 (Haskell) a061467 0 = 0 a061467 n = mod (max n n') (min n n') where n' = a004086 n -- Reinhard Zumkeller, Dec 31 2013 CROSSREFS Cf. A002113, A004086, A008919, A118959. Sequence in context: A220510 A078086 A337171 * A103168 A298584 A238475 Adjacent sequences:  A061464 A061465 A061466 * A061468 A061469 A061470 KEYWORD base,easy,nice,nonn AUTHOR Erich Friedman, Jun 16 2001 STATUS approved

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.

Last modified September 27 08:39 EDT 2021. Contains 347689 sequences. (Running on oeis4.)