|
%I #12 Oct 17 2014 19:46:44
%S 1,1,1,1,1,1,1,1,2,3,1,1,6,2,3,9,1,2,8,5,3,6,7,8,71,1,5,4,55,4,4,4,33,
%T 3,81,1,295,42,3,5,2,4,101,122,21,11,4,5,1442,3,457,8,89,164,6,1,526,
%U 3,676,1,7,4,333,1,1,85,1,91,139,2504,17,4,2,50
%N Number of partitions of A066926(n) into x_i parts.
%H Giovanni Resta, <a href="/A068348/b068348.txt">Table of n, a(n) for n = 1..200</a>
%e a(9) = 2 because 36 = 6+6+6+6+6+6 = 3+3+6+12+12 has two partitions into a set of x_i.
%e a(10) = 3 because 40 = 4+4+8+8+8+8 = 4+5+5+8+8+10 = 5+5+5+5+10+10 has three partitions of that kind. - _R. J. Mathar_, Jul 12 2013
%p A068348 := proc(n)
%p local a,p,xi,rep ;
%p a := 0 ;
%p for p in combinat[partition](n) do
%p rep := true ;
%p for xi in p do
%p if not type(n/xi,'integer') then
%p rep := false;
%p end if;
%p end do:
%p if rep then
%p q := n*add(1/xi,xi=p) ;
%p if q =n then
%p a := a+1 ;
%p end if;
%p end if;
%p end do:
%p a ;
%p end proc:
%p for n from 1 do
%p isA068348 := A068348(n) ;
%p if isA068348 > 0 then
%p print(isA068348) ;
%p end if:
%p end do: # _R. J. Mathar_, Jul 12 2013
%K nonn
%O 1,9
%A _Naohiro Nomoto_, Feb 28 2002
%E a(18)-a(74) from _Giovanni Resta_, Feb 23 2014
|
