[go: up one dir, main page]

login
Number of partitions of n into 10 parts such that every i-th smallest part (counted with multiplicity) is different from i.
2

%I #4 Jun 23 2014 12:06:32

%S 1,10,46,139,329,660,1173,1918,2938,4277,5990,8123,10742,13903,17678,

%T 22140,27383,33487,40560,48710,58055,68734,80881,94657,110223,127771,

%U 147478,169580,194278,221842,252503,286579,324327,366120,412247,463132,519112,580667

%N Number of partitions of n into 10 parts such that every i-th smallest part (counted with multiplicity) is different from i.

%H Alois P. Heinz, <a href="/A244246/b244246.txt">Table of n, a(n) for n = 65..1000</a>

%Y Column k=10 of A238406.

%K nonn

%O 65,2

%A _Alois P. Heinz_, Jun 23 2014