%I A130689
%S A130689 1,1,2,3,5,6,10,11,16,19,26,28,41,43,56,65,82,88,115,122,155,174,209,
%T A130689 225,283,305,363,402,477,514,622,666,783,858,990,1078,1268,1362,1561,
%U A130689 1708,1958,2111,2433,2613,2976,3247,3652,3938,4482,4821,5422
%N A130689 Number of partitions of n such that every part divides the largest part.
%F A130689 G.f.: Sum_{n>=0} x^n/Product_{d divides n} (1-x^d).
%e A130689 For n =6 we have 10 such partitions: [1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 
               2],
%e A130689 [1, 1, 2, 2], [2, 2, 2], [1, 1, 1, 3], [3, 3], [1, 1, 4], [2, 4], [1, 
               5], [6].
%Y A130689 Cf. A018818, A083710, A097986, A117086.
%Y A130689 Sequence in context: A003238 A051839 A130714 this_sequence A024560 A000039 
               A053436
%Y A130689 Adjacent sequences: A130686 A130687 A130688 this_sequence A130690 A130691 
               A130692
%K A130689 easy,nonn
%O A130689 0,3
%A A130689 Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 01 2007