login
A360737
Analog of the Moser-Newman sum sequence A005599, but counting 0's (instead of 1's) in the binary representation of 3*n.
0
0, 1, 2, 1, 2, 3, 4, 3, 4, 3, 2, 1, 2, 3, 4, 3, 4, 5, 6, 7, 8, 9, 10, 9, 10, 9, 8, 7, 8, 9, 10, 9, 10, 9, 8, 7, 6, 5, 4, 3, 4, 3, 2, 1, 2, 3, 4, 3, 4, 5, 6, 7, 8, 9, 10, 9, 10, 9, 8, 7, 8, 9, 10, 9, 10, 11, 12, 13, 14, 15, 16, 17, 16, 17, 18, 19, 20, 21, 22
OFFSET
0,3
LINKS
J. Shallit, Rarefied Thue-Morse sums via automata theory and logic, arXiv:2302.09436 [math.NT], February 18 2023.
FORMULA
a(n) = Sum_{i=0..n-1} (-1)^A080791(3*i).
CROSSREFS
Sequence in context: A214962 A350809 A366525 * A076258 A259576 A330636
KEYWORD
nonn
AUTHOR
Jeffrey Shallit, Feb 18 2023
STATUS
approved