This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A211359 #11 May 03 2018 17:02:52
%S A211359 1,0,1,1,0,1,1,1,0,1,2,1,2,0,1,2,3,2,2,0,1,5,4,8,3,3,0,1,6,11,12,12,4,
%T A211359 3,0,1,14,21,39,24,22,5,4,0,1,22,55,84,85,48,30,7,4,0,1,51,124,245,
%U A211359 228,190,82,46,8,5,0,1,95,327,620,730,570,350,136,60
%N A211359 Triangle read by rows: T(n,k) is the number of noncrossing partitions up to rotation and reflection of an n-set that contain k singleton blocks.
%H A211359 Andrew Howroyd, <a href="/A211359/b211359.txt">Table of n, a(n) for n = 0..1274</a> (terms 0..90 from Tilman Piesk)
%e A211359 From _Andrew Howroyd_, May 02 2018: (Start)
%e A211359 Triangle begins:
%e A211359 1;
%e A211359 0, 1;
%e A211359 1, 0, 1;
%e A211359 1, 1, 0, 1;
%e A211359 2, 1, 2, 0, 1;
%e A211359 2, 3, 2, 2, 0, 1;
%e A211359 5, 4, 8, 3, 3, 0, 1;
%e A211359 6, 11, 12, 12, 4, 3, 0, 1;
%e A211359 14, 21, 39, 24, 22, 5, 4, 0, 1;
%e A211359 22, 55, 84, 85, 48, 30, 7, 4, 0, 1;
%e A211359 51, 124, 245, 228, 190, 82, 46, 8, 5, 0, 1;
%e A211359 ...
%e A211359 (End)
%o A211359 (PARI) \\ See A303875 for NCPartitionsModDihedral
%o A211359 { my(rows=Vec(NCPartitionsModDihedral(vector(10, k, if(k==1,y,1)))));
%o A211359 for(n=1, #rows, for(k=0, n-1, print1(polcoeff(rows[n], k), ", ")); print; ) } \\ _Andrew Howroyd_, May 02 2018
%Y A211359 Column k=0 is A303931.
%Y A211359 Row sums are A111275.
%Y A211359 Cf. A209612, A211357, A303875.
%K A211359 nonn,tabl
%O A211359 0,11
%A A211359 _Tilman Piesk_, Apr 12 2012