Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
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
Sequence in context: A135506 A295516 A330209 * A351517 A337224 A090079
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 11:30 EDT 2024. Contains 375266 sequences. (Running on oeis4.)