14927768

Appears in sequences

• Divide each Fibonacci number by its primitive part.at n=53A105602
• a(n) = gcd(F(n), product{k|n,k<n} F(k)), where F(k) is k-th Fibonacci number.at n=53A111079
• Convolution of A066983 with the double Fibonacci sequence A103609.at n=35A121364
• Sum of successive Fibonacci numbers F(n) : a(n) = Sum_{k = 0..n} F(n+k).at n=17A362067