id:A104145 - OEIS Search Results

Search: id:A104145

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; let A(k) = sequence of first 2^(k-1) terms; then A(k+1) is concatenation of A(k) and (A(k)-1) if a(k) is odd, or concatenation of A(k) and (A(k)+1) if a(k) is even.

+0
2

1, 0, 2, 1, 2, 1, 3, 2, 0, -1, 1, 0, 1, 0, 2, 1, 2, 1, 3, 2, 3, 2, 4, 3, 1, 0, 2, 1, 2, 1, 3, 2, 0, -1, 1, 0, 1, 0, 2, 1, -1, -2, 0, -1, 0, -1, 1, 0, 1, 0, 2, 1, 2, 1, 3, 2, 0, -1, 1, 0, 1, 0, 2, 1, 0, -1, 1, 0, 1, 0, 2, 1, -1, -2, 0, -1, 0, -1, 1, 0, 1, 0, 2, 1, 2, 1, 3, 2, 0, -1, 1, 0, 1, 0, 2, 1, -1, -2, 0, -1, 0, -1, 1, 0, -2, -3, -1, -2, -1, -2, 0, -1, 0, -1, 1 (list; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.

AT&T Labs Research