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 #6 Feb 24 2017 17:56:49
%S 1,1,2,1,2,1,3,1,3,1,2,4,1,2,1,4,2,4,1,2,4,1,5,1,5,1,2,3,6,1,2,1,3,1,
%T 6,2,3,2,6,3,6,1,2,3,1,2,6,1,3,6,2,3,6,1,2,3,6,1,7,1,7,1,2,4,8,1,2,1,
%U 4,1,8,2,4,2,8,4,8,1,2,4,1,2,8,1,4,8,2
%N Concatenation 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 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 {1}, {5}, {1, 5};
%e ...
%e Concatenation: 1, 1, 2, 1, 2, 1, 3, 1, 3, ...
%Y Cf. A193360 (concatenation of P{1..n}).
%K nonn
%O 1,3
%A _Jaroslav Krizek_, Feb 24 2017