cp's OEIS Frontend

A327489 T(n, k) = 1 + NOR(k - 1, n - k), where NOR is the Peirce arrow operating bitwise on the inputs, triangle read by rows, T(n, k) for n >= 1, 1 <= k <= n.

%I A327489 #11 Sep 22 2019 07:17:31
%S A327489 1,1,1,2,1,2,1,1,1,1,4,1,2,1,4,3,3,1,1,3,3,2,3,2,1,2,3,2,1,1,1,1,1,1,
%T A327489 1,1,8,1,2,1,4,1,2,1,8,7,7,1,1,3,3,1,1,7,7,6,7,6,1,2,3,2,1,6,7,6,5,5,
%U A327489 5,5,1,1,1,1,5,5,5,5
%N A327489 T(n, k) = 1 + NOR(k - 1, n - k), where NOR is the Peirce arrow operating bitwise on the inputs, triangle read by rows, T(n, k) for n >= 1, 1 <= k <= n.
%e A327489                                1
%e A327489                               1, 1
%e A327489                             2, 1, 2
%e A327489                            1, 1, 1, 1
%e A327489                          4, 1, 2, 1, 4
%e A327489                         3, 3, 1, 1, 3, 3
%e A327489                       2, 3, 2, 1, 2, 3, 2
%e A327489                      1, 1, 1, 1, 1, 1, 1, 1
%e A327489                    8, 1, 2, 1, 4, 1, 2, 1, 8
%e A327489                   7, 7, 1, 1, 3, 3, 1, 1, 7, 7
%e A327489                 6, 7, 6, 1, 2, 3, 2, 1, 6, 7, 6
%e A327489                5, 5, 5, 5, 1, 1, 1, 1, 5, 5, 5, 5
%e A327489              4, 5, 6, 5, 4, 1, 2, 1, 4, 5, 6, 5, 4
%e A327489             3, 3, 5, 5, 3, 3, 1, 1, 3, 3, 5, 5, 3, 3
%e A327489           2, 3, 2, 5, 2, 3, 2, 1, 2, 3, 2, 5, 2, 3, 2
%e A327489          1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
%p A327489 A327489 := (n, k) -> 1 + Bits:-Nor(k-1, n-k):
%p A327489 seq(seq(A327489(n, k), k=1..n), n=1..12);
%Y A327489 Cf. A327488 (Nand), A327490 (Iff), A280172 (Xor).
%Y A327489 T(2n+1,n+1) gives A080079.
%K A327489 nonn,tabl
%O A327489 1,4
%A A327489 _Peter Luschny_, Sep 22 2019