This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A061467 #25 Feb 19 2024 10:30:56
%S A061467 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,
%T A061467 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,
%U A061467 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
%N A061467 Remainder when the larger of n and its reverse is divided by the smaller.
%C A061467 a(n)=0 if n is in A002113, A008919 or A118959. - _Robert Israel_, Jul 18 2019
%H A061467 Harry J. Smith, <a href="/A061467/b061467.txt">Table of n, a(n) for n = 0..1000</a>
%e A061467 a(12)=9 since 21/12 = 1 with remainder 9.
%t A061467 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 *)
%t A061467 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 *)
%o A061467 (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
%o A061467 (Haskell)
%o A061467 a061467 0 = 0
%o A061467 a061467 n = mod (max n n') (min n n') where n' = a004086 n
%o A061467 -- _Reinhard Zumkeller_, Dec 31 2013
%Y A061467 Cf. A002113, A004086, A008919, A118959.
%K A061467 base,easy,nice,nonn
%O A061467 0,13
%A A061467 _Erich Friedman_, Jun 16 2001