Number of cycles induced by iterating the Gray-coding of an n-bit number: a(n+1) = a(n) + 2^n/C_n, where C_n = least power of 2 >= n (C_n is the length of the cycle), with a(0) = 1.

A007886

Number of cycles induced by iterating the Gray-coding of an n-bit number: a(n+1) = a(n) + 2^n/C_n, where C_n = least power of 2 >= n (C_n is the length of the cycle), with a(0) = 1.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =4a(4) =6a(5) =8a(6) =12a(7) =20a(8) =36a(9) =52a(10) =84a(11) =148a(12) =276a(13) =532a(14) =1044a(15) =2068a(16) =4116a(17) =6164a(18) =10260a(19) =18452a(20) =34836a(21) =67604a(22) =133140a(23) =264212a(24) =526356a(25) =1050644a(26) =2099220a(27) =4196372a(28) =8390676a(29) =16779284

External references