login
A393435
a(n) = (-1)^A033264(n).
0
1, 1, -1, 1, -1, -1, -1, 1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, 1, 1, 1, -1, -1, -1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, 1, 1, 1, -1, 1, 1, -1, 1, -1, -1, -1, 1, 1, 1, -1, 1, 1, 1, 1, -1, -1, -1, 1, -1, 1, 1, 1
OFFSET
0
COMMENTS
A033264(n) is the number of occurrences of 10 in the binary expansion of n.
LINKS
Patrick Morton and W. J. Mourant, Paper folding, digit patterns and groups of arithmetic fractals, Proceedings of the London Mathematical Society 3.2 (1989): 253-293. [The present sequence is the subject of Table 1]
MAPLE
a:= n-> (-1)^nops([StringTools[SearchAll]("01", cat("", Bits[Split](n)[]))]):
seq(a(n), n=0..102); # Alois P. Heinz, Mar 07 2026
MATHEMATICA
a[n_]:=(-1)^SequenceCount[IntegerDigits[n, 2], {1, 0}]; Array[a, 103, 0] (* Stefano Spezia, Mar 07 2026 *)
CROSSREFS
Cf. A033264.
Sequence in context: A065357 A119665 A121241 * A122188 A158388 A162285
KEYWORD
sign,base
AUTHOR
N. J. A. Sloane, Mar 07 2026
STATUS
approved