login
a(n) = gcd((prime(n)+1)*(prime(n+1)+1)/4, prime(n)*prime(n+1)+1).
4

%I #13 Oct 19 2019 21:17:40

%S 1,2,12,6,6,3,18,6,4,60,4,3,42,6,4,2,30,2,6,36,8,6,2,3,3,204,6,54,3,

%T 48,6,2,138,6,300,4,2,6,4,2,90,12,96,3,396,10,14,6,114,3,8,120,6,2,4,

%U 4,540,4,3,282,6,6,6,156,3,6,2,6,174,3,4,6,4,2,6,4,3,3,15,6,210,12,216,4,6,2

%N a(n) = gcd((prime(n)+1)*(prime(n+1)+1)/4, prime(n)*prime(n+1)+1).

%C a(n) = gcd(A079079(n), A023523(n+1)).

%H Reinhard Zumkeller, <a href="/A079080/b079080.txt">Table of n, a(n) for n = 1..10000</a>

%o (Haskell)

%o a079080 n = a079079 n `gcd` a023523 (n + 1)

%o -- _Reinhard Zumkeller_, Oct 09 2012

%Y Cf. A079081, A079082.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Dec 22 2002