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 A324377 #12 Feb 28 2019 18:53:19 %S A324377 0,1,3,1,7,1,5,11,15,1,9,19,11,23,25,13,31,1,17,35,19,39,41,21,23,47, %T A324377 49,25,53,27,7,57,63,1,33,67,35,71,73,37,39,79,81,41,85,43,11,89,47, %U A324377 95,97,49,101,51,13,105,109,55,7,113,29,117,119,15,127,1,65,131,67,135,137,69,71,143,145,73,149,75,19 %N A324377 a(0) = 0; for n > 0, a(n) = A000265(A005187(n)). %H A324377 Antti Karttunen, <a href="/A324377/b324377.txt">Table of n, a(n) for n = 0..16385</a> %H A324377 Antti Karttunen, <a href="/A324377/a324377.txt">Data supplement: n, a(n) computed for n = 0..65537</a> %H A324377 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A324377 a(0) = 0; for n > 0, a(n) = A000265(A005187(n)) = A005187(n) / 2^A324379(n). %F A324377 a(n) = A322821(A283477(n)). %o A324377 (PARI) %o A324377 A000265(n) = (n/2^valuation(n, 2)); %o A324377 A005187(n) = { my(s=n); while(n>>=1, s+=n); s; }; %o A324377 A324377(n) = if(!n,n,A000265(A005187(n))); %Y A324377 Cf. A000265, A005187, A283477, A322821, A324287, A324378, A324379. %K A324377 nonn %O A324377 0,3 %A A324377 _Antti Karttunen_, Feb 28 2019