cp's OEIS Frontend

A352938 Irregular table T(n, k), n >= 0, k = 1..A080100(n), read by rows: the n-th row contains in ascending order the distinct nonnegative integers k <= n that have no common 1-bit with n.

%I A352938 #26 Jan 05 2024 13:43:41
%S A352938 0,0,0,1,0,0,1,2,3,0,2,0,1,0,0,1,2,3,4,5,6,7,0,2,4,6,0,1,4,5,0,4,0,1,
%T A352938 2,3,0,2,0,1,0,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,0,2,4,6,8,10,12,
%U A352938 14,0,1,4,5,8,9,12,13,0,4,8,12,0,1,2,3,8,9,10,11
%N A352938 Irregular table T(n, k), n >= 0, k = 1..A080100(n), read by rows: the n-th row contains in ascending order the distinct nonnegative integers k <= n that have no common 1-bit with n.
%C A352938 See A353293 for the other k's.
%H A352938 Rémy Sigrist, <a href="/A352938/b352938.txt">Table of n, a(n) for n = 0..9841</a> (rows for n = 0..511 flattened)
%H A352938 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A352938 T(n, 1) = 0.
%F A352938 T(n, A080100(n)) = A035327(n) for any n > 0.
%e A352938 Irregular table T(n, k) begins:
%e A352938      0:   [0]
%e A352938      1:   [0]
%e A352938      2:   [0, 1]
%e A352938      3:   [0]
%e A352938      4:   [0, 1, 2, 3]
%e A352938      5:   [0, 2]
%e A352938      6:   [0, 1]
%e A352938      7:   [0]
%e A352938      8:   [0, 1, 2, 3, 4, 5, 6, 7]
%e A352938      9:   [0, 2, 4, 6]
%e A352938     10:   [0, 1, 4, 5]
%e A352938     11:   [0, 4]
%e A352938     12:   [0, 1, 2, 3]
%e A352938     13:   [0, 2]
%e A352938     14:   [0, 1]
%e A352938     15:   [0]
%o A352938 (PARI) row(n) = select(k -> bitand(n, k)==0, [0..n])
%Y A352938 Cf. A035327, A080100 (row length), A335587 (row sums), A353293.
%K A352938 nonn,tabf,look,base
%O A352938 0,8
%A A352938 _Rémy Sigrist_, Apr 09 2022