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 A324114 #8 Feb 19 2019 18:19:12 %S A324114 -1,0,-1,1,-1,2,1,2,-2,2,1,5,0,6,1,3,-2,2,3,5,3,10,7,8,1,6,8,11,0,10, %T A324114 6,4,-2,2,4,6,1,12,5,8,3,12,14,19,6,22,15,11,-1,8,8,12,6,24,18,16,1, %U A324114 12,15,19,7,18,6,5,-1,2,2,6,4,12,6,10,2,12,15,21,10,22,15,11,2,14,12,21,18,36,28,28,9,24,31,37,17,38,21,14,0,8,7 %N A324114 A000120-deficiency of n permuted by Doudna-sequence: a(n) = A192895(A005940(1+n)). %H A324114 Antti Karttunen, <a href="/A324114/b324114.txt">Table of n, a(n) for n = 0..16384</a> %H A324114 Antti Karttunen, <a href="/A324114/a324114.txt">Data supplement: n, a(n) computed for n = 0..65537</a> %H A324114 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A324114 a(n) = A192895(A005940(1+n)). %F A324114 For n > 0, a(n) = A324194(A054429(n)). %o A324114 (PARI) %o A324114 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940 %o A324114 A192895(n) = sumdiv(n, d, hammingweight(d)*(-1)^(d==n)); %o A324114 A324114(n) = A192895(A005940(1+n)); %Y A324114 Cf. A005940, A054429, A192895, A324194. %Y A324114 Cf. also A324100, A324055. %K A324114 sign %O A324114 0,6 %A A324114 _Antti Karttunen_, Feb 19 2019