cp's OEIS Frontend

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.

A369458 Arithmetic derivative of the odd part of n, permuted by A163511 ("Doudna-sequence mirrored").

This page as a plain text file.
%I A369458 #6 Jan 28 2024 10:52:45
%S A369458 0,0,0,1,0,6,1,1,0,27,6,10,1,8,1,1,0,108,27,75,6,55,10,14,1,39,8,12,1,
%T A369458 10,1,1,0,405,108,500,27,350,75,147,6,240,55,119,10,91,14,22,1,162,39,
%U A369458 95,8,71,12,18,1,51,10,16,1,14,1,1,0,1458,405,3125,108,2125,500,1372,27,1425,350,1078,75,784,147,363
%N A369458 Arithmetic derivative of the odd part of n, permuted by A163511 ("Doudna-sequence mirrored").
%H A369458 Antti Karttunen, <a href="/A369458/b369458.txt">Table of n, a(n) for n = 0..16384</a>
%F A369458 a(n) = A369465(A163511(n)).
%o A369458 (PARI)
%o A369458 A000265(n) = (n>>valuation(n,2));
%o A369458 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A369458 A163511(n) = if(!n,1,my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
%o A369458 A369458(n) = A003415(A000265(A163511(n)));
%Y A369458 Cf. A000265, A003415, A163511, A369459 (rgs-transform), A369465.
%K A369458 nonn
%O A369458 0,6
%A A369458 _Antti Karttunen_, Jan 28 2024