Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Mar 03 2017 20:44:39
%S 1,1,2,3,1,3,4,1,2,4,3,5,6,7,1,5,6,1,2,3,6,3,4,7,5,8,9,6,9,10,11,12,1,
%T 7,8,1,2,4,8,3,5,9,6,10,12,7,11,13,14,15,1,3,9,4,10,12,13,1,2,5,10,3,
%U 6,11,7,12,15,8,13,16,17,18,1,11,12,1,2,3,4,6
%N Concatenation of the sums of elements of P{d_1}, P{d_2}, P{d_3}, ..., P{d_n}; where P{d_n} denote the power set of the set of divisors of n ordered by the size of the subsets, and in each subset, following the increasing order.
%e Rows with power sets of set of divisors of n (without nonempty sets):
%e {1};
%e {1}, {2}, {1, 2};
%e {1}, {3}, {1, 3};
%e {1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {1, 2, 4};
%e ...
%e Rows with the sums of elements of these subsets:
%e 1;
%e 1, 2, 3;
%e 1, 3, 4;
%e 1, 2, 4, 3, 5, 6, 7;
%e ...
%e Concatenation: 1, 1, 2, 3, 1, 3, 4, 1, 2, 4, 3, 5, 6, 7, ...
%Y Cf. A282903, A282934, A282936.
%K nonn
%O 1,3
%A _Jaroslav Krizek_, Feb 25 2017