reviewed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
reviewed
approved
proposed
reviewed
editing
proposed
(PARPARI) A280910(n) = if(n<=1, n, my(b = binary(n)); if ((#b % 2) && (b[#b\2+1] == 0), return (0)); vecmin(vector(#b\2, k, bitxor(b[k], b[#b-k+1]))) == 1); \\ Antti Karttunen, Dec 23 2018, after isok function given in A277238 by Michel Marcus, Oct 07 2016
approved
editing
proposed
approved
editing
proposed
<a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
Antti Karttunen, <a href="/A280910/b280910.txt">Table of n, a(n) for n = 0..65537</a>
<a href="/index/Ch#char_fns">Index entries for characteristic functions</a>
0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
1
0
(PAR) A280910(n) = if(n<=1, n, my(b = binary(n)); if ((#b % 2) && (b[#b\2+1] == 0), return (0)); vecmin(vector(#b\2, k, bitxor(b[k], b[#b-k+1]))) == 1); \\ Antti Karttunen, Dec 23 2018, after isok function given in A277238 by Michel Marcus, Oct 07 2016
Term a(0) = 0 prepended and more terms added by Antti Karttunen, Dec 23 2018
approved
editing
proposed
approved