|
%I #7 Aug 01 2019 03:48:11
%S 1,2,1,1,4,1,1,2,1,1,2,1,1,2,3,1,2,5,1,2,1,1,2,1,1,6,1,1,2,1,1,2,3,1,
%T 2,3,1,4,3,1,2,1,1,2,1,3,2,1,3,4,1,1,8,1,1,6,1,1,6,1,1,2,5,1,2,3,1,4,
%U 3,1,2,3,1,2,3,1,2,3,1,2,3,1,4,1,1,2
%N a(n) = gcd(A084937(n), A084937(n+3)).
%C gcd(A084937(n), A084937(n+1)) = gcd(A084937(n), A084937(n+2)) = 1 by definition of A084937.
%H Reinhard Zumkeller, <a href="/A249694/b249694.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o a249694 n = a249694_list !! (n-1)
%o a249694_list = zipWith gcd (drop 3 a084937_list) a084937_list
%Y Cf. A084937.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Nov 04 2014
|
