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!)
A374116 a(n) = gcd(A328768(n), A328845(n)), where A328768 is the first primorial based variant and A328845 is the first Fibonacci-based variant of the arithmetic derivative, respectively. 0

%I #6 Jun 28 2024 21:10:51

%S 0,0,1,2,4,1,7,1,12,12,1,1,20,1,1,1,32,1,33,1,4,1,1,1,52,10,1,54,4,1,

%T 1,1,80,1,1,4,84,1,1,1,4,1,1,1,4,3,1,1,128,14,5,1,4,1,135,4,4,1,1,1,4,

%U 1,1,3,192,6,1,1,4,1,1,1,204,1,1,10,4,2,1,1,16,216,1,1,4,6,1,1,4,1,3,360,4,1,1,24,304,1,7,3,20

%N a(n) = gcd(A328768(n), A328845(n)), where A328768 is the first primorial based variant and A328845 is the first Fibonacci-based variant of the arithmetic derivative, respectively.

%H Antti Karttunen, <a href="/A374116/b374116.txt">Table of n, a(n) for n = 0..100000</a>

%o (PARI)

%o A002110(n) = prod(i=1,n,prime(i));

%o A328768(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]*A002110(primepi(f[i,1])-1)/f[i, 1]));

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

%o A374116(n) = gcd(A328768(n), A328845(n));

%Y Cf. A328768, A328845.

%Y Cf. also A374035, A374106.

%K nonn,new

%O 0,4

%A _Antti Karttunen_, Jun 28 2024

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 July 2 06:12 EDT 2024. Contains 373947 sequences. (Running on oeis4.)