|
%I #6 Aug 20 2015 23:18:50
%S 1,33,649,9867,128128,1495494,16169582,165128106,1614040569,
%T 15243617122,140077132527,1259032371268,11113681284310,96651906757351,
%U 830215997132500,7058003214939325,59483840519561029,497656193129904666,4137685991512873657,34220461452762531960
%N Number of set partitions of [n] into exactly ten parts such that no part contains two elements with a circular distance less than three.
%H Alois P. Heinz, <a href="/A261486/b261486.txt">Table of n, a(n) for n = 10..1000</a>
%F G.f.: (40320*x^15 +40320*x^14 +48860*x^13 +166984*x^12 +71309*x^11 +116207*x^10 +54005*x^9 +42266*x^8 +16992*x^7 +8686*x^6 +2664*x^5 +964*x^4 +204*x^3 +52*x^2 +6*x+1) *x^10 / ((x-1) *(8*x-1) *(6*x-1) *(4*x-1) *(3*x-1) *(2*x-1) *(5*x-1) *(7*x-1) *(x+1) *(x^2+x+1) *(7*x^2+x+1) *(3*x^2+x+1) *(2*x^2+x+1) *(4*x^2+x+1) *(5*x^2+x+1) *(8*x^2+x+1) *(6*x^2+x+1)).
%e a(10) = 1: 1|2|3|4|5|6|7|8|9|10.
%Y Column k=10 of A261477.
%K nonn,easy
%O 10,2
%A _Alois P. Heinz_, Aug 20 2015
|
