|
%I #44 Mar 23 2024 19:47:48
%S 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,
%T 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,
%U 3,4,5,1,2,4,5,2,4,5,1,4,5,4,5,1,2,3,5,2,3,5
%N 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.
%H Paolo Xausa, <a href="/A368494/b368494.txt">Table of n, a(n) for n = 0..10384</a> (rows 0..2200 of the triangle, flattened).
%e Triangle begins:
%e [0] 1;
%e [1] 0;
%e [2] 1;
%e [3] 0;
%e [4] 1, 2;
%e [5] 2;
%e [6] 1;
%e [7] 0;
%e [8] 1, 2, 3;
%e ...
%e Row n = 50 is 1, 3, 4:
%e binary expansion of 50: 1 1 0 0 1 0
%e positions of zeros: - - 4 3 - 1
%t Array[Replace[Flatten[Position[Reverse[IntegerDigits[#, 2]], 0]], {} -> {0}] &, 100, 0]
%Y Cf. A030308, A359400 (row sums), A048793 (positions of ones).
%K nonn,base,tabf,easy
%O 0,6
%A _Paolo Xausa_, Mar 18 2024
|
