|
%I #7 Nov 19 2019 18:03:12
%S 1,8,26,11,7,46,33,94,277,130,85,180,173,47,434,131,60,297,1175,569,
%T 40,305,1243,142,1024,213,169,775,988,900,1622,262,470,844,812,2391,
%U 9480,2607,1624,441,1061,2845,1686,501,749,109,6958,449,572,174,178,2887
%N Least k such that gcd( p(k), q(k) ) is n, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).
%t Do[ d = GCD[ PartitionsP[ n ], PartitionsQ[ n ]]; If[ a[[ d ]] == 0, a[[ d ]] = n ], {n, 1, 10400} ]; Table[ a[[ n ]], {n, 1, 60} ]
%t With[{p=Table[GCD[PartitionsP[n],PartitionsQ[n]],{n,10000}]},Table[ Position[ p,n,1,1],{n,60}]]//Flatten (* _Harvey P. Dale_, Nov 19 2019 *)
%K nonn
%O 1,2
%A _Robert G. Wilson v_, Apr 23 2001
|
