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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068822 a(n) = gcd(n,c(n)), where c(n) is the 10's complement of n. 4
 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 4, 1, 2, 5, 4, 1, 2, 1, 20, 1, 2, 1, 4, 25, 2, 1, 4, 1, 10, 1, 4, 1, 2, 5, 4, 1, 2, 1, 20, 1, 2, 1, 4, 5, 2, 1, 4, 1, 50, 1, 4, 1, 2, 5, 4, 1, 2, 1, 20, 1, 2, 1, 4, 5, 2, 1, 4, 1, 10, 1, 4, 1, 2, 25, 4, 1, 2, 1, 20, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..9999 FORMULA a(n) = gcd(n,A089186(n)) = gcd(n,A178914(n)). - Alois P. Heinz, Nov 05 2018 EXAMPLE a(45) = 5 as 10's complement of 45 is 100-45 = 55 and (45,55) = 5. MAPLE a:=n-> igcd((10^length(n)-n), n): seq(a(n), n=1..100);  # Alois P. Heinz, Sep 22 2015 MATHEMATICA GCD[#, 10^(IntegerLength[#]) - #] & /@ Range[82] (* Jayanta Basu, Aug 07 2013 *) CROSSREFS Cf. A089186, A178914. Sequence in context: A135506 A295516 A330209 * A337224 A090079 A165195 Adjacent sequences:  A068819 A068820 A068821 * A068823 A068824 A068825 KEYWORD nonn,base,easy AUTHOR Amarnath Murthy, Mar 08 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 November 29 22:54 EST 2020. Contains 338779 sequences. (Running on oeis4.)