login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051348 a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n. 1

%I #20 Sep 07 2021 02:45:45

%S 1,1,1,3,1,4,1,21,17,11,1,72,1,29,61,987,1,1292,1,1353,421,199,1,

%T 23184,15005,521,98209,24447,1,83204,1,2178309,19801,3571,141961,

%U 7465176,1,9349,135721,20466831,1,10304396,1,7880997,113490317,64079,1

%N a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.

%H Harvey P. Dale, <a href="/A051348/b051348.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = 1 if n is prime. - _Joerg Arndt_, Sep 07 2021

%e a(15) = F(15) / (F(3) * F(5)) = 610 / (2*5) = 61.

%t fib[n_]:=Fibonacci[n]/Times@@(Fibonacci[#]&/@Transpose[ FactorInteger[ n]][[1]]); Array[fib,50] (* _Harvey P. Dale_, May 19 2012 *)

%Y Cf. A000045.

%K nonn

%O 1,4

%A _Leroy Quet_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)