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.

A295299 Numbers k such that the sum of the divisors (A000203) and the binary weight of k (A000120) have different parity.

This page as a plain text file.
%I A295299 #21 Jul 24 2021 23:12:51
%S A295299 7,9,11,13,14,18,19,21,22,26,28,31,35,36,37,38,41,42,44,47,52,55,56,
%T A295299 59,61,62,67,69,70,72,73,74,76,79,82,84,87,88,91,93,94,97,103,104,107,
%U A295299 109,110,112,115,117,118,122,124,127,131,133,134,137,138,140,143,144,145,146,148,151,152,155,157,158,161,164,167,168,169
%N A295299 Numbers k such that the sum of the divisors (A000203) and the binary weight of k (A000120) have different parity.
%C A295299 Numbers k for which A010059(k) = A053866(k).
%C A295299 This sequence is the union of all terms of A028982 (squares and twice squares) that are evil (A001969), and all odious numbers (A000069) that are neither a square or twice a square. See also A231431, A235001.
%C A295299 This is a subsequence of A004169, numbers k such that phi(k) is not a power of 2. See comment in A295298 for the reason. - _Antti Karttunen_, Nov 27 2017
%H A295299 Antti Karttunen, <a href="/A295299/b295299.txt">Table of n, a(n) for n = 1..10000</a>
%H A295299 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%t A295299 Select[Range@ 169, UnsameQ @@ Map[EvenQ, {DivisorSigma[1, #], DigitCount[#, 2, 1]}] &] (* _Michael De Vlieger_, Nov 26 2017 *)
%Y A295299 Complement of A295298.
%Y A295299 Subsequence of A004169.
%Y A295299 Cf. A000069, A001969, A000120, A000203, A010059, A028982, A053866, A231431, A235001, A295297 (characteristic function).
%K A295299 nonn
%O A295299 1,1
%A A295299 _Antti Karttunen_, Nov 26 2017