This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055483 GCD of n and the reverse of n. 20
 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 3, 1, 1, 3, 1, 1, 9, 1, 2, 3, 22, 1, 6, 1, 2, 9, 2, 1, 3, 1, 1, 33, 1, 1, 9, 1, 1, 3, 4, 1, 6, 1, 44, 9, 2, 1, 12, 1, 5, 3, 1, 1, 9, 55, 1, 3, 1, 1, 6, 1, 2, 9, 2, 1, 66, 1, 2, 3, 7, 1, 9, 1, 1, 3, 1, 77, 3, 1, 8, 9, 2, 1, 12, 1, 2, 3, 88, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 99, 1, 101, 3, 1, 1, 3, 1, 1, 9, 1, 11, 111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(A226778(n)) = 1; a(A071249(n)) > 1. - Reinhard Zumkeller, Jun 18 2013 a(n) == n iff n is in A002113. - Felix Fröhlich, Oct 28 2014 LINKS T. D. Noe and Indranil Ghosh, Table of n, a(n) for n = 1..50000 (first 1000 terms from T. D. Noe) FORMULA a(n) = gcd(n, A004086(n)). - Felix Fröhlich, Oct 28 2014 EXAMPLE a(12) = 3 since gcd(12,21) = 3. a(101) = gcd(101,101) = 101. MAPLE R:=proc(q) local x, k; x:=convert(q, base, 10); add(x[k]*10^(nops(x)-k), k=1..nops(x)); end: seq(gcd(i, R(i)), i=1..111); # Paolo P. Lava, Mar 02 2018 MATHEMATICA gcn[n_]:=GCD[n, IntegerReverse[n]]; Array[gcn, 120] (* Harvey P. Dale, Jan 23 2012 *) PROG (Haskell) a055483 n = gcd n \$ a004086 n  -- Reinhard Zumkeller, Jun 18 2013 (PARI) a004086(n)=eval(concat(Vecrev(Str(n)))) a(n)=gcd(n, a004086(n)) \\ Felix Fröhlich, Oct 28 2014 (MAGMA) [Gcd(n, Seqint(Reverse(Intseq(n)))): n in [1..100]]; // Vincenzo Librandi, Oct 29 2014 CROSSREFS Different from A069652. Sequence in context: A047813 A084051 A069652 * A059717 A004185 A068636 Adjacent sequences:  A055480 A055481 A055482 * A055484 A055485 A055486 KEYWORD base,easy,nonn,nice AUTHOR Erich Friedman, Jun 27 2000 EXTENSIONS Edited by Robert G. Wilson v, Apr 10 2002 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 October 22 00:52 EDT 2019. Contains 328315 sequences. (Running on oeis4.)