This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A374106 #8 Jun 28 2024 14:54:36 %S A374106 0,1,2,2,5,1,13,3,4,3,89,4,233,1,1,4,1597,1,4181,1,1,9,28657,1,10,1,6, %T A374106 5,514229,1,1346269,5,1,1,2,6,24157817,17,5,4,165580141,1,433494437,1, %U A374106 3,7,2971215073,2,26,1,1,1,53316291173,1,2,4,1,3,956722026041,1,2504730781961,1,1,6,2,1,44945570212853,3,1,1 %N A374106 a(n) = gcd(A113177(n), A328845(n)), where A113177 is fully additive with a(p) = Fibonacci(p) and A328845 is the first Fibonacci-based variant of the arithmetic derivative. %H A374106 Antti Karttunen, <a href="/A374106/b374106.txt">Table of n, a(n) for n = 1..4500</a> %F A374106 For all n >= 1, a(A000040(n)) = A030426(n). %o A374106 (PARI) %o A374106 A113177(n) = if(n<=1, 0, my(f=factor(n)); sum(i=1, #f~, f[i, 2]*fibonacci(f[i,1]))); %o A374106 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 A374106 A374106(n) = gcd(A113177(n), A328845(n)); %Y A374106 Cf. A000040, A000045, A030426, A113177, A328845. %Y A374106 Cf. also A374035. %K A374106 nonn %O A374106 1,3 %A A374106 _Antti Karttunen_, Jun 28 2024