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
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
A081939(3)=6 and A081939(4)=8, so a(3)=gcd(6,8)=2.
MAPLE
# with list R containing terms of A081939
seq(igcd(R[i], R[i+1]), i=1..nops(R)-1)
CROSSREFS
Cf. A081939.
Sequence in context: A112727 A164918 A147822 * A084961 A226398 A248768
KEYWORD
nonn,base
AUTHOR
Robert Israel, Jul 04 2018
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 March 28 13:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)