|
%I #17 Dec 05 2018 04:00:36
%S 1,1,1,1,4,1,11,1,1,29,61,1,1,421,199,1,521,1,83204,1,19801,3571,
%T 141961,1,9349,135721,1,10304396,1,64079,1,6376021,1,313671601,
%U 43701901,1149851,1,1,3010349,14736206161,156055561996,1,2053059121
%N a(n) = F(n-th squarefree)/product{p=primes,p|(n-th squarefree)} F(p), where F(m) is m-th Fibonacci number.
%H Robert Israel, <a href="/A115022/b115022.txt">Table of n, a(n) for n = 1..2938</a>
%e The 7th squarefree integer is 10 = 2*5. So a(7) = F(10)/(F(2)F(5)) = 55/(1*5) = 11.
%p count:= 0:
%p for n from 1 while count < 50 do
%p if numtheory:-issqrfree(n) then
%p count:= count+1;
%p A[count]:= combinat:-fibonacci(n)/mul(combinat:-fibonacci(p),p=numtheory:-factorset(n))
%p fi
%p od:
%p seq(A[i],i=1..50); # _Robert Israel_, Dec 04 2018
%t f[n_] := Fibonacci[n]/Times @@ (Fibonacci /@ FactorInteger[n][[;; , 1]]); f /@
%t Select[Range[70], SquareFreeQ[#] &] (* _Amiram Eldar_, Dec 04 2018 *)
%Y Cf. A075731.
%Y a(n)=1 if n is in A071403.
%K nonn,look
%O 1,5
%A _Leroy Quet_, Feb 28 2006
%E More terms from _Joshua Zucker_, Jul 18 2007
|
