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!)
A316497 a(n) = gcd(A081939(n), A081939(n+1)). 2

%I #15 Jul 05 2018 04:30:14

%S 2,2,2,2,11,11,11,11,11,11,11,3,3,3,3,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,

%T 2,13,5,7,2,2,2,2,2,2,2,2,3,3,3,3,2,2,2,2,2,2,2,2,22,22,22,22,22,22,

%U 22,22,22,11,11,11,11,11,11,11,11,11,11,11,22,22,22,22,22,22,22,22,22,11,55

%N a(n) = gcd(A081939(n), A081939(n+1)).

%H Robert Israel, <a href="/A316497/b316497.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>

%e A081939(3)=6 and A081939(4)=8, so a(3)=gcd(6,8)=2.

%p # with list R containing terms of A081939

%p seq(igcd(R[i],R[i+1]),i=1..nops(R)-1)

%Y Cf. A081939.

%K nonn,base

%O 1,1

%A _Robert Israel_, Jul 04 2018

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 July 31 10:28 EDT 2024. Contains 374779 sequences. (Running on oeis4.)