|
%I #9 Jun 30 2023 01:01:40
%S 0,0,1,0,2,0,3,0,1,3,4,0,1,4,5,0,6,0,7,0,1,7,8,0,1,2,3,6,7,8,9,0,2,3,
%T 7,8,10,0,3,8,11,0,1,3,9,11,12,0,1,12,13,0,14,0,15,0,1,15,16,0,1,2,3,
%U 14,15,16,17,0,2,3,4,6,12,14,15,16,18,0,3,4,7,12,15,16,19
%N Irregular table T(n, k), n >= 0, k = 1..A363710(n), read by rows; the n-th row lists the nonnegative numbers m <= n such that A003188(m) AND A003188(n-m) = 0 (where AND denotes the bitwise AND operator).
%C This sequence is related to the T-square fractal (see A363710).
%H Rémy Sigrist, <a href="/A363930/b363930.txt">Table of n, a(n) for n = 0..13126</a> (rows for n = 0..2^9 flattened)
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/T-square_(fractal)">T-square (fractal)</a>
%F T(n, 1) = 0.
%F T(n, A363710(n)) = n.
%F T(n, k) + T(n, A363710(n)+1-k) = n.
%e Table T(n, k) begins:
%e n n-th row
%e -- ----------------------
%e 0 0
%e 1 0, 1
%e 2 0, 2
%e 3 0, 3
%e 4 0, 1, 3, 4
%e 5 0, 1, 4, 5
%e 6 0, 6
%e 7 0, 7
%e 8 0, 1, 7, 8
%e 9 0, 1, 2, 3, 6, 7, 8, 9
%e 10 0, 2, 3, 7, 8, 10
%e 11 0, 3, 8, 11
%e 12 0, 1, 3, 9, 11, 12
%e 13 0, 1, 12, 13
%e 14 0, 14
%e 15 0, 15
%e 16 0, 1, 15, 16
%o (PARI) row(n) = { select (m -> bitand(bitxor(m, m\2), bitxor(n-m, (n-m)\2))==0, [0..n]) }
%Y See A295989, A353174 and A362327 for similar sequences.
%Y Cf. A003188, A363710.
%K nonn,base,tabf
%O 0,5
%A _Rémy Sigrist_, Jun 28 2023
|
