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!)
A103159 a(n) = GCD(reverse(n), reversed(n+1)). 1

%I #11 Dec 12 2021 20:12:35

%S 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,

%T 1,1,1,1,1,2,2,2,2,2,2,2,2,2,1,5,5,5,5,5,5,5,5,5,1,2,2,2,2,2,2,2,2,2,

%U 1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1

%N a(n) = GCD(reverse(n), reversed(n+1)).

%H Alois P. Heinz, <a href="/A103159/b103159.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = GCD(A004086(n), A004086(n+1)).

%t rd[x_] :=FromDigits[Reverse[IntegerDigits[x]]] Table[GCD[rd[w], rd[w+1]], {w, 1, 100}]

%o (Python)

%o from math import gcd

%o def a(n): return gcd(int(str(n)[::-1]), int(str(n+1)[::-1]))

%o print([a(n) for n in range(1, 106)]) # _Michael S. Branicky_, Dec 12 2021

%Y Cf. A004086.

%K base,nonn

%O 1,20

%A _Labos Elemer_, Jan 25 2005

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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)