login
Refined triangle A211358: T(n,k) is the number of partitions up to rotation and reflection of an n-set that are of type k (k-th integer partition, defined by A194602).
1

%I #7 Apr 18 2012 15:49:10

%S 1,1,1,1,1,1,1,2,1,2,1,1,2,2,3,1,2,1,1,3,3,8,3,6,1,5,3,3,1,1,3,4,12,4,

%T 18,3,11,9,7,1,12,3,4,1,1,4,5,22,8,38,5,39,33,25,4,57,12,19,1,17,22,

%U 25,4,5,7,1,1,4,7,30,10,76,10,85,76,55

%N Refined triangle A211358: T(n,k) is the number of partitions up to rotation and reflection of an n-set that are of type k (k-th integer partition, defined by A194602).

%C The rows are counted from 1, the columns from 0.

%C Row lengths: 1,2,3,5,7,11... (partition numbers A000041)

%C Row sums: 1,2,3,7,12,37... (A084708)

%C Row maxima: 1,1,1,2,3,8,18,57,228,668,3220

%C Distinct entries per row: 1,1,1,2,3,5,8,14,17,26,30

%C Rightmost columns are those from the triangle A052307 without the second column.

%H Tilman Piesk, <a href="/A211354/b211354.txt">Rows n=1..11 of triangle, flattened</a>

%H Tilman Piesk, <a href="http://en.wikiversity.org/wiki/Partition_related_number_triangles#rotref1">Partition related number triangles</a>

%Y Cf. A211358, A000041, A084708, A052307.

%K tabf,nonn

%O 1,8

%A _Tilman Piesk_, Apr 09 2012