cp's OEIS Frontend

A327490 T(n, k) = 1 + IFF(k - 1, n - k), where IFF is Boolean equality evaluated bitwise on the inputs, triangle read by rows, T(n, k) for n >= 1, 1 <= k <= n.

%I A327490 #8 Sep 22 2019 07:16:42
%S A327490 1,1,1,2,2,2,1,1,1,1,4,2,4,2,4,3,3,3,3,3,3,2,4,2,4,2,4,2,1,1,1,1,1,1,
%T A327490 1,1,8,2,4,2,8,2,4,2,8,7,7,3,3,7,7,3,3,7,7,6,8,6,4,6,8,6,4,6,8,6,5,5,
%U A327490 5,5,5,5,5,5,5,5,5,5
%N A327490 T(n, k) = 1 + IFF(k - 1, n - k), where IFF is Boolean equality evaluated bitwise on the inputs, triangle read by rows, T(n, k) for n >= 1, 1 <= k <= n.
%C A327490 If row(n) has, seen as a set, only one element k then k is either 1 or 1 + 2^n and n has the form 2^n or 3*2^n.
%e A327490                                1
%e A327490                               1, 1
%e A327490                             2, 2, 2
%e A327490                            1, 1, 1, 1
%e A327490                          4, 2, 4, 2, 4
%e A327490                         3, 3, 3, 3, 3, 3
%e A327490                       2, 4, 2, 4, 2, 4, 2
%e A327490                      1, 1, 1, 1, 1, 1, 1, 1
%e A327490                    8, 2, 4, 2, 8, 2, 4, 2, 8
%e A327490                   7, 7, 3, 3, 7, 7, 3, 3, 7, 7
%e A327490                 6, 8, 6, 4, 6, 8, 6, 4, 6, 8, 6
%e A327490                5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
%p A327490 A327490 := (n, k) -> 1 + Bits:-Iff(k-1, n-k):
%p A327490 seq(seq(A327490(n, k), k=1..n), n=1..12);
%Y A327490 Cf. A327488 (Nand), A327489 (Nor), A280172 (Xor).
%K A327490 nonn,tabl
%O A327490 1,4
%A A327490 _Peter Luschny_, Sep 22 2019