|
%I #28 Jan 20 2024 09:12:11
%S 0,1,2,1,2,2,2,3,3,4,1,2,2,3,2,2,3,3,4,3,4,2,3,3,4,3,4,4,3,4,4,5,4,5,
%T 5,6,1,2,2,3,2,3,3,4,2,2,3,3,4,3,4,4,5,3,4,2,3,3,4,3,4,4,5,3,4,4,3,4,
%U 4,5,4,5,5,6,4,5,5,6,2,3,3,4,3,4,4,5,3
%N Triangle read by rows: T(n, k) = A000120(n) + A000120(k), 0 <= k <= n.
%C T(n, k) is the sum of the Hamming weight of n and the Hamming weight of k.
%C See A365618 for a table read by antidiagonals.
%F T(n, k) = A000120(n) + A000120(k).
%e Triangle begins:
%e k=0 1 2 3 4 5
%e n=0: 0;
%e n=1: 1, 2;
%e n=2: 1, 2, 2;
%e n=3: 2, 3, 3, 4;
%e n=4: 1, 2, 2, 3, 2;
%e n=5: 2, 3, 3, 4, 3, 4;
%e ...
%t T[n_, k_] := DigitCount[n, 2, 1] + DigitCount[k, 2, 1]
%Y Cf. A000069, A000120, A000788, A001969, A365618.
%K nonn,easy,tabl
%O 0,3
%A _Mithra Karamchedu_ and _Sophia Pi_, Nov 03 2023
|
