login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #4 Jun 23 2014 12:05:46

%S 1,9,37,101,220,410,684,1062,1553,2174,2943,3875,4995,6319,7876,9689,

%T 11798,14219,17005,20179,23798,27894,32531,37743,43610,50169,57509,

%U 65679,74778,84858,96036,108373,121997,136983,153471,171546,191373,213040,236731,262556

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

%H Alois P. Heinz, <a href="/A244245/b244245.txt">Table of n, a(n) for n = 54..1000</a>

%Y Column k=9 of A238406.

%K nonn

%O 54,2

%A _Alois P. Heinz_, Jun 23 2014