|
Search: id:A061467
|
|
|
| A061467 |
|
Remainder when the larger of n and its reverse is divided by the smaller. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
0,13
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
EXAMPLE
|
a(12)=9 since 21/12=1 with remainder 9
|
|
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 (jmf234(AT)nau.edu), Jun 05 2008
|
|
PROGRAM
|
(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) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 23 2009]
|
|
CROSSREFS
|
Sequence in context: A010543 A154830 A078086 this_sequence A103168 A146282 A117911
Adjacent sequences: A061464 A061465 A061466 this_sequence A061468 A061469 A061470
|
|
KEYWORD
|
base,easy,nice,nonn
|
|
AUTHOR
|
Erich Friedman (efriedma(AT)stetson.edu), Jun 16 2001
|
|
|
Search completed in 0.002 seconds
|
