cp's OEIS Frontend

A214587 Greatest common divisor of a number and its last decimal digit: a(n) = gcd(n, n mod 10).

%I A214587 #11 Aug 02 2019 03:45:33
%S A214587 0,1,2,3,4,5,6,7,8,9,10,1,2,1,2,5,2,1,2,1,20,1,2,1,4,5,2,1,4,1,30,1,2,
%T A214587 3,2,5,6,1,2,3,40,1,2,1,4,5,2,1,8,1,50,1,2,1,2,5,2,1,2,1,60,1,2,3,4,5,
%U A214587 6,1,4,3,70,1,2,1,2,5,2,7,2,1,80,1,2,1,4,5
%N A214587 Greatest common divisor of a number and its last decimal digit: a(n) = gcd(n, n mod 10).
%e A214587 a(69) = gcd(69,9) = 3.
%t A214587 Table[GCD[n, Mod[n, 10]], {n, 0, 100}] (* _T. D. Noe_, Jul 24 2012 *)
%o A214587 (Java)
%o A214587 import java.math.BigInteger;
%o A214587 public class A214587 {
%o A214587   public static void main (String[] args) {
%o A214587     for (long n=0; n<222; n++) {
%o A214587     BigInteger bn=BigInteger.valueOf(n), ld=BigInteger.valueOf(n%10);
%o A214587     System.out.printf("%s, ", bn.gcd(ld).toString());
%o A214587     }
%o A214587   }
%o A214587 }
%Y A214587 Cf. A068822.
%K A214587 nonn,base
%O A214587 0,3
%A A214587 _Alex Ratushnyak_, Jul 22 2012