editing
approved
editing
approved
(PARI) is(n)=bitxor(n, 32*n)==33*n \\ Charles R Greathouse IV, Sep 25 2024
approved
editing
_Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, Feb 04 2006
<a href="/Sindx_index/Con.html#CongruXOR">Index entries for sequences defined by congruent products under XOR</a>
<a href="/Sindx_Con.html#CongruXOR">Index entries for sequences defined by congruent products under XOR</a>
nonn,new
nonn
<a href="http://www.research.att.com/~njas/sequences/Sindx_Con.html#CongruXOR">Index entries for sequences defined by congruent products under XOR</a>
nonn,new
nonn
nonn,new
nonn
Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystemsgmail.com), Feb 04 2006
Numbers m such that m XOR 32*m = 33*m.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 65, 68, 69, 72, 73, 76, 77, 80, 81, 84, 85, 88, 89, 92, 93, 96, 100, 104, 108, 112, 116, 120
0,3
A116361(a(n)) <= 5.
<a href="http://www.research.att.com/~njas/sequences/Sindx_Con.html#CongruXOR">Index entries for sequences defined by congruent products under XOR</a>
nonn
Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 04 2006
approved