a(n) = gcd(Sum_{k=1...n} F(k), Product{j=1...n} F(j)), where F(k) is the k-th Fibonacci number.

Terms

a(0) =1a(1) =1a(2) =2a(3) =1a(4) =6a(5) =20a(6) =3a(7) =18a(8) =8a(9) =143a(10) =8a(11) =8a(12) =21a(13) =986a(14) =84a(15) =63a(16) =220a(17) =6764a(18) =55a(19) =770a(20) =144a(21) =46367a(22) =144a(23) =432a(24) =377a(25) =317810a(26) =16588a(27) =377a(28) =43428a(29) =2178308