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.

A363788 Even primitive binary Niven numbers: even terms of A363787.

This page as a plain text file.
%I A363788 #6 Jun 24 2023 13:22:24
%S A363788 6,10,18,34,60,66,92,108,116,126,130,156,172,180,204,212,222,228,246,
%T A363788 258,284,300,308,318,332,340,356,366,378,396,404,414,420,438,452,462,
%U A363788 474,486,498,514,540,556,564,588,596,606,612,630,652,660,676,708,726,780
%N A363788 Even primitive binary Niven numbers: even terms of A363787.
%C A363788 The odd terms of A363787 are all the odd binary Niven numbers (A144302).
%C A363788 This sequence is infinite. E.g., A052548(k) = 2^k + 2 is a term for all k >= 2.
%H A363788 Amiram Eldar, <a href="/A363788/b363788.txt">Table of n, a(n) for n = 1..10000</a>
%t A363788 binNivQ[n_] := Divisible[n, DigitCount[n, 2, 1]]; q[n_] := binNivQ[n] && ! (EvenQ[n] && binNivQ[n/2]); Select[Range[2, 1000, 2], q]
%o A363788 (PARI) isbinniv(n) = !(n % hammingweight(n));
%o A363788 is(n) = !(n%2) && isbinniv(n) && !isbinniv(n/2);
%Y A363788 Subsequence of A049445 and A363787.
%Y A363788 Equals A363787 \ A144302.
%Y A363788 Cf. A052548, A358255 (decimal analog).
%K A363788 nonn,easy,base
%O A363788 1,1
%A A363788 _Amiram Eldar_, Jun 22 2023