This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A340547 #13 Oct 31 2022 05:54:40
%S A340547 1,1,2,1,2,4,1,2,3,8,1,2,4,4,16,1,2,4,8,6,32,1,2,3,8,16,8,64,1,2,3,4,
%T A340547 13,32,11,128,1,2,4,4,6,16,64,12,256,1,2,2,8,5,8,26,128,16,512,1,2,4,
%U A340547 8,16,6,11,32,256,22,1024
%N A340547 Square array, read by ascending antidiagonals, where row n gives all solutions n > 0 to A000120(n+1) = A000120((n+1)*k), A000120 is the Hamming weight.
%C A340547 Solutions to related equation A000120(k) = A000120(k*n) are A340351.
%C A340547 The same sequence without leading ones and only odd solutions is A340441.
%F A340547 T(2n, ...) = 2^{0,1,2,...}, 2^{0,1,2,...} * row n of A340441.
%F A340547 T(4n+1, ...) = 2^{0,1,2,...}, 2^{0,1,2,...} * row n of A340441.
%F A340547 T(2^n, ...) = 2^{0,1,2,...}.
%e A340547 Eight initial terms of rows 1-8 are listed below:
%e A340547 1: 1, 2, 4, 8, 16, 32, 64, 128, ...
%e A340547 2: 1, 2, 3, 4, 6, 8, 11, 12, ...
%e A340547 3: 1, 2, 4, 8, 16, 32, 64, 128, ...
%e A340547 4: 1, 2, 4, 8, 13, 16, 26, 32, ...
%e A340547 5: 1, 2, 3, 4, 6, 8, 11, 12, ...
%e A340547 6: 1, 2, 3, 4, 5, 6, 7, 8, ...
%e A340547 7: 1, 2, 4, 8, 16, 32, 64, 128, ...
%e A340547 8: 1, 2, 4, 8, 16, 32, 57, 64, ...
%e A340547 T(3,4) = 8 because: (3+1) in binary is 100 and (3*1)*8 = 32 in binary is 100000, both have 1 bit set to 1.
%Y A340547 Cf. A000120, A340351, A340069, A340441.
%Y A340547 Cf. A263132 (superset of 1st row), A007583 (1st row), A299960 (2nd row).
%K A340547 nonn,base,tabl
%O A340547 1,3
%A A340547 _Thomas Scheuerle_, Jan 11 2021