The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ... (OEIS A000035). It can be represented as a_n | = | 1/2[1 - (-1)^n] | = | 1/2 (-1)^n[-1 + (-1)^n] or a_n = n (mod 2). It is also given by the linear recurrence equation a_n = 1 - a_(n - 1) with a_1 = 1.

binary | bit | significant digits