login

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”).

A102392
Odious numbers in odious places.
4
0, 1, 2, 0, 4, 0, 0, 7, 8, 0, 0, 11, 0, 13, 14, 0, 16, 0, 0, 19, 0, 21, 22, 0, 0, 25, 26, 0, 28, 0, 0, 31, 32, 0, 0, 35, 0, 37, 38, 0, 0, 41, 42, 0, 44, 0, 0, 47, 0, 49, 50, 0, 52, 0, 0, 55, 56, 0, 0, 59, 0, 61, 62, 0, 64, 0, 0, 67, 0, 69, 70, 0, 0, 73, 74, 0, 76, 0, 0, 79, 0, 81, 82, 0, 84, 0
OFFSET
0,3
COMMENTS
Odious numbers A000069(n) appear at positions indexed by the odious numbers, 0 otherwise. A001477(n)=A102391(n)+A102392(n).
LINKS
FORMULA
a(n)=if((1+floor(n/2))(1+(-1)^A000120(n))/2=0, n, 0); a(n)=if((1+floor(n/2))(1+(-1)^A010060(n))/2=0, n, 0).
MATHEMATICA
odnQ[n_]:=OddQ[DigitCount[n, 2, 1]]; Table[If[odnQ[n], n, 0], {n, 0, 100}] (* Harvey P. Dale, Oct 15 2019 *)
PROG
(Python)
def A102392(n): return n*(n.bit_count()&1) # Chai Wah Wu, Nov 23 2023
CROSSREFS
Sequence in context: A081120 A200038 A249093 * A227311 A178515 A344874
KEYWORD
easy,nonn,base
AUTHOR
Paul Barry, Jan 06 2005
STATUS
approved