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.

A234037 The union of odious numbers with evil squares and evil numbers with odious squares.

This page as a plain text file.
%I A234037 #38 Aug 31 2020 02:40:13
%S A234037 5,9,10,13,17,18,20,21,23,26,29,33,34,36,37,39,40,42,43,46,47,51,52,
%T A234037 58,61,65,66,68,69,71,72,73,74,75,77,78,80,81,84,85,86,89,92,93,94,95,
%U A234037 101,102,104,107,109,113,115,116,122,125,129,130,132,133,135,136,137
%N A234037 The union of odious numbers with evil squares and evil numbers with odious squares.
%C A234037 Numbers n with odd sum of binary weight of n and binary weight of n^2.
%C A234037 Primes are in this sequence: 5, 13, 17, 23, 29, 37, 43, 47, 61, 71, 73,....
%C A234037 Evil numbers with odious squares: 5, 9, 10, 17, 18, 20, 23, 29, 33, 34,...
%C A234037 Odious numbers with evil squares: 13, 21, 26, 37, 42, 47, 52, 61, 69,...
%H A234037 Amiram Eldar, <a href="/A234037/b234037.txt">Table of n, a(n) for n = 1..10000</a>
%e A234037 a(3) = 10 because 2 (binary weight of 10) + 3 (binary weight of 100) = 5 (odd).
%e A234037 a(4) = 13 because 3 (binary weight of 13) + 4 (binary weight of 169) = 7 (odd).
%t A234037 Select[Range[100], Mod[DigitCount[#, 2, 1], 2] != Mod[DigitCount[#^2, 2, 1], 2] &] (* _Amiram Eldar_, Aug 31 2020 *)
%Y A234037 Cf. A000069, A000120, A001969, A159918, A231431, A235001.
%K A234037 nonn,base
%O A234037 1,1
%A A234037 _Gerasimov Sergey_, Jan 13 2014
%E A234037 Wrong term removed by _Amiram Eldar_, Aug 31 2020