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!)
A328846 The second Fibonacci based variant of arithmetic derivative: a(p) = A000045(2+A000720(p)) for prime p, a(u*v) = a(u)*v + u*a(v), with a(0) = a(1) = 0. 7

%I #9 Oct 29 2019 21:06:02

%S 0,0,2,3,8,5,12,8,24,18,20,13,36,21,30,30,64,34,54,55,60,45,48,89,96,

%T 50,68,81,88,144,90,233,160,72,102,75,144,377,148,102,160,610,132,987,

%U 140,135,224,1597,240,112,150,153,188,2584,216,120,232,222,346,4181,240,6765,528,198,384,170,210,10946,272,336,220,17711,360

%N The second Fibonacci based variant of arithmetic derivative: a(p) = A000045(2+A000720(p)) for prime p, a(u*v) = a(u)*v + u*a(v), with a(0) = a(1) = 0.

%H Antti Karttunen, <a href="/A328846/b328846.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = n * Sum e_j * A000045(2+A000720(p_j))/p_j for n = Product p_j^e_j.

%F a(A000040(n)) = A000045(2+n).

%F A007895(a(n)) = A328848(n).

%o (PARI) A328846(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]*fibonacci(2+primepi(f[i,1]))/f[i, 1]));

%Y Cf. A000040, A000045, A000720, A003965, A007895, A328848.

%Y Cf. also A003415, A258851, A328768, A328769, A328845.

%K nonn

%O 0,3

%A _Antti Karttunen_, Oct 28 2019

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 May 11 05:30 EDT 2024. Contains 372388 sequences. (Running on oeis4.)