All a(n) = 1 or 2; a(1) = 1; get next 2^k terms by repeating first 2^k terms and changing last element so sum of first 2^(k+1) terms is odd.

A056832

All a(n) = 1 or 2; a(1) = 1; get next 2^k terms by repeating first 2^k terms and changing last element so sum of first 2^(k+1) terms is odd.

Terms

    a(0) =1a(1) =2a(2) =1a(3) =1a(4) =1a(5) =2a(6) =1a(7) =2a(8) =1a(9) =2a(10) =1a(11) =1a(12) =1a(13) =2a(14) =1a(15) =1a(16) =1a(17) =2a(18) =1a(19) =1a(20) =1a(21) =2a(22) =1a(23) =2a(24) =1a(25) =2a(26) =1a(27) =1a(28) =1a(29) =2

External references