login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A218535
Greatest common divisor of consecutive terms in A176352.
4
1, 2, 3, 3, 4, 4, 5, 5, 15, 9, 3, 5, 5, 25, 35, 14, 7, 7, 8, 4, 7, 7, 7, 14, 42, 42, 30, 18, 8, 16, 20, 10, 25, 45, 27, 27, 33, 11, 11, 11, 33, 33, 33, 24, 6, 9, 9, 12, 15, 15, 21, 21, 42, 66, 36, 108, 117, 13, 65, 91, 91, 91, 13, 13, 39, 33, 22, 22, 11, 13
OFFSET
1,2
COMMENTS
a(n) = gcd(A176352(n),A176352(n+1)).
LINKS
PROG
(Haskell)
import Data.Ratio ((%), numerator, denominator)
a218535 n = a218535_list !! (n-1)
a218535_list = zipWith gcd a176352_list $ tail a176352_list
-- .
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Nov 10 2012
STATUS
approved