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 A380932 #11 Feb 10 2025 01:41:50
%S A380932 322245,590205,874665,966735,1934415,2900205,3224025,3378375,3869775,
%T A380932 4729725,6081075,6449625,6818175,7740495,8783775,8906625,9029475,
%U A380932 9889425,10135125,10961685,11609325,11821425,12900825,13378365,14189175,15049125,15481935,15909075,16253055
%N A380932 Odd numbers k such that A380845(k) > 2*k.
%C A380932 The odd terms in A380929.
%C A380932 Analogous to odd abundant numbers (A005231) with A380845 instead of A000203.
%H A380932 Amiram Eldar, <a href="/A380932/b380932.txt">Table of n, a(n) for n = 1..2306</a>
%e A380932 322245 is a term since it is odd, and A380845(322245) = 679582 > 2 * 322245 = 644490.
%t A380932 q[k_] := Module[{h = DigitCount[k, 2, 1]}, DivisorSum[k, # &, DigitCount[#, 2, 1] == h &] > 2*k]; Select[Range[1,10^6,2], q]
%o A380932 (PARI) isok(k) = if(!(k % 2), 0, my(h = hammingweight(k)); sumdiv(k, d, d*(hammingweight(d) == h)) > 2*k);
%Y A380932 Cf. A000203, A380845.
%Y A380932 Intersection of A005408 and A380929.
%Y A380932 Subsequence of A005231.
%Y A380932 Similar sequences: A094889, A127666, A129485, A293186, A321147, A339938, A348275, A360526, A379031.
%K A380932 nonn,base
%O A380932 1,1
%A A380932 _Amiram Eldar_, Feb 08 2025