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.

A376618 Odd binary Niven numbers (A144302) k such that k/wt(k) is also an odd binary Niven number, where wt(k) = A000120(k) is the binary weight of k.

This page as a plain text file.
%I A376618 #7 Sep 30 2024 12:50:11
%S A376618 1,345,405,775,1305,1425,1435,1605,2125,2325,2485,2765,2825,4235,4305,
%T A376618 4459,4655,4725,5085,5145,5607,5625,5929,6223,6405,7515,7623,8145,
%U A376618 10625,11151,11835,12325,12355,12425,13527,13825,13995,14805,16695,18445,20505,20625,20925
%N A376618 Odd binary Niven numbers (A144302) k such that k/wt(k) is also an odd binary Niven number, where wt(k) = A000120(k) is the binary weight of k.
%C A376618 If m is a term then 2^k * m is a term of A376616 for all k >= 0.
%H A376618 Amiram Eldar, <a href="/A376618/b376618.txt">Table of n, a(n) for n = 1..10000</a>
%e A376618 345 is a term since it is odd, 345/wt(345) = 69 is an integer, and 69/wt(69) = 23 is an integer.
%t A376618 q[k_] := Module[{w = DigitCount[k, 2, 1]}, Divisible[k, w] && Divisible[k/w, DigitCount[k/w, 2, 1]]]; Select[Range[1, 21000, 2], q]
%o A376618 (PARI) is(k) = if(!(k % 2), 0, my(w = hammingweight(k)); !(k % w) && !((k/w) % hammingweight(k/w)));
%Y A376618 Intersection of A005408 and A376616.
%Y A376618 Subsequence of A049445 and A144302.
%Y A376618 Cf. A000120.
%K A376618 nonn,easy,base
%O A376618 1,2
%A A376618 _Amiram Eldar_, Sep 30 2024