|
%I #4 Apr 18 2012 15:50:04
%S 1,0,1,1,0,1,1,1,0,1,3,1,2,0,1,3,4,2,2,0,1,12,11,12,4,3,0,1,24,41,33,
%T 20,5,3,0,1,103,162,151,77,39,7,4,0,1,387,715,648,386,154,56,10,4,0,1,
%U 1819,3425,3255,1944,876,278,88,12,5,0,1
%N Triangle read by rows: T(n,k) is the number of partitions up to rotation of an n-set that contain k singleton blocks.
%H Tilman Piesk, <a href="/A211356/b211356.txt">Table of n, a(n) for n = 0..77</a>
%K nonn,tabl
%O 0,11
%A _Tilman Piesk_, Apr 12 2012
|
