login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238684 a(1) = a(2) = 1; for n > 2, a(n) is the product of prime factors of the n-th Fibonacci number. 0

%I

%S 1,1,2,3,5,2,13,21,34,55,89,6,233,377,610,987,1597,646,4181,6765,

%T 10946,17711,28657,966,15005,121393,196418,317811,514229,208010,

%U 1346269,2178309,3524578,5702887,9227465,207366,24157817,39088169,63245986,102334155,165580141,66978574,433494437,701408733,1134903170

%N a(1) = a(2) = 1; for n > 2, a(n) is the product of prime factors of the n-th Fibonacci number.

%C In other words, the squarefree part of the n-th Fibonacci number.

%F a(n) = A007947(A000045(n)) - _Tom Edgar_, Mar 03 2014

%e a(12) = 6 since F(12) = 144 = 2^4 * 3^2 and 2 * 3 = 6.

%t Table[Times@@Part[Flatten[FactorInteger[Fibonacci[n]]], 1 ;; -2 ;; 2], {n, 3, 50}] (* _Alonso del Arte_, Mar 02 2014 *)

%o (PARI) a(n) = my(f = factor(fibonacci(n))); prod(i=1, #f~, f[i, 1]); \\ _Michel Marcus_, Mar 02 2014

%Y Cf. A000045, A080648.

%K nonn

%O 1,3

%A _Carmine Suriano_, Mar 02 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 10:34 EDT 2021. Contains 343909 sequences. (Running on oeis4.)