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 A376616 #7 Sep 30 2024 12:49:50
%S A376616 1,2,4,8,12,16,20,24,32,36,40,48,64,68,72,80,96,126,128,132,136,144,
%T A376616 160,192,240,252,256,260,264,272,276,288,320,324,345,368,384,405,414,
%U A376616 432,460,464,480,486,504,512,516,520,528,544,552,576,624,640,648,688,690
%N A376616 Binary Niven numbers (A049445) k such that k/wt(k) is also a binary Niven number, where wt(k) = A000120(k) is the binary weight of k.
%C A376616 Numbers k such that A376615(k) = 0 or A376615(k) >= 3.
%C A376616 If m is a term then 2^k * m is a term for all k >= 0.
%H A376616 Amiram Eldar, <a href="/A376616/b376616.txt">Table of n, a(n) for n = 1..10000</a>
%e A376616 12 is a term since 12/wt(12) = 6 is an integer and also 6/wt(6) = 3 is an integer.
%t A376616 q[k_] := Module[{w = DigitCount[k, 2, 1]}, Divisible[k, w] && Divisible[k/w, DigitCount[k/w, 2, 1]]]; Select[Range[1000], q]
%o A376616 (PARI) is(k) = {my(w = hammingweight(k)); !(k % w) && !((k/w) % hammingweight(k/w));}
%Y A376616 Subsequence of A049445.
%Y A376616 Subsequences: A000079, A376617, A376618.
%Y A376616 Cf. A000120, A376615.
%K A376616 nonn,easy,base
%O A376616 1,2
%A A376616 _Amiram Eldar_, Sep 30 2024