|
%I #4 Apr 18 2012 15:53:28
%S 1,0,1,1,0,1,1,1,0,1,3,1,2,0,1,3,4,2,2,0,1,12,7,11,3,3,0,1,20,28,21,
%T 16,4,3,0,1,81,89,101,43,30,5,4,0,1,238,395,356,223,86,40,7,4,0,1,
%U 1079,1757,1783,1004,504,148,62,8,5,0,1
%N Triangle read by rows: T(n,k) is the number of partitions up to rotation and reflection of an n-set that contain k singleton blocks.
%H Tilman Piesk, <a href="/A211358/b211358.txt">Table of n, a(n) for n = 0..77</a>
%K nonn,tabl
%O 0,11
%A _Tilman Piesk_, Apr 12 2012
|
