A368494 Irregular triangle read by rows: row n lists the 1-based positions (starting from the right) of zeros in the binary expansion of n, or 0 if the binary expansion of n contains only ones.
1, 0, 1, 0, 1, 2, 2, 1, 0, 1, 2, 3, 2, 3, 1, 3, 3, 1, 2, 2, 1, 0, 1, 2, 3, 4, 2, 3, 4, 1, 3, 4, 3, 4, 1, 2, 4, 2, 4, 1, 4, 4, 1, 2, 3, 2, 3, 1, 3, 3, 1, 2, 2, 1, 0, 1, 2, 3, 4, 5, 2, 3, 4, 5, 1, 3, 4, 5, 3, 4, 5, 1, 2, 4, 5, 2, 4, 5, 1, 4, 5, 4, 5, 1, 2, 3, 5, 2, 3, 5
Offset: 0
Examples
Triangle begins: [0] 1; [1] 0; [2] 1; [3] 0; [4] 1, 2; [5] 2; [6] 1; [7] 0; [8] 1, 2, 3; ... Row n = 50 is 1, 3, 4: binary expansion of 50: 1 1 0 0 1 0 positions of zeros: - - 4 3 - 1
Links
- Paolo Xausa, Table of n, a(n) for n = 0..10384 (rows 0..2200 of the triangle, flattened).
Programs
-
Mathematica
Array[Replace[Flatten[Position[Reverse[IntegerDigits[#, 2]], 0]], {} -> {0}] &, 100, 0]