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!)
A113222 a(n) = sum{p=primes, p|n} F(p^(m_{n,p})), where p^(m_{n,p}) is highest power of p dividing n, m= nonnegative integer and F(k) is the k-th Fibonacci number. 2

%I #10 Apr 09 2014 10:16:31

%S 0,1,2,3,5,3,13,21,34,6,89,5,233,14,7,987,1597,35,4181,8,15,90,28657,

%T 23,75025,234,196418,16,514229,8,1346269,2178309,91,1598,18,37,

%U 24157817,4182,235,26,165580141,16,433494437,92,39,28658,2971215073,989

%N a(n) = sum{p=primes, p|n} F(p^(m_{n,p})), where p^(m_{n,p}) is highest power of p dividing n, m= nonnegative integer and F(k) is the k-th Fibonacci number.

%F Additive with a(p^e) = F(p^e).

%e 12 = 2^2 * 3^1. So a(12) = F(2^2) + F(3^1) = 3 + 2 = 5.

%t f[n_] := Plus @@ (Fibonacci[ #[[1]]^#[[2]]] & /@ FactorInteger[n]); Table[ f[n], {n, 49}] (* _Robert G. Wilson v_ *)

%Y Cf. A113195.

%K nonn

%O 1,3

%A _Leroy Quet_, Oct 18 2005

%E More terms from _Robert G. Wilson v_, Oct 21 2005

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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)