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 A130760 #10 May 19 2025 12:20:11
%S A130760 1,1,1,3,6,10,30,105,280,756,2520,6930,18480,60060,180180,675675,
%T A130760 2162160,6806800,24504480,77597520,232792560,888844320,3259095840,
%U A130760 10708457760,37479602160,133855722000,435031096500,1445641797600,5059746291600,17468171721000,58227239070000
%N A130760 Noncrossing set partition version of A102356.
%D A130760 D. E. Knuth, The Art of Computer Programming, vol. 4, section 7.2.1.5, problem 65.
%H A130760 Vaclav Kotesovec, <a href="/A130760/b130760.txt">Table of n, a(n) for n = 0..75</a>
%e A130760 a(7) = 105 because there are 105 noncrossing set partitions of {1,2,3,4,5,6,7} of type {3,2,1,1} and all other integer partitions of 7 produce fewer noncrossing set partitions.
%t A130760 <<Combinatorica`
%t A130760 ncsp[p_] := FactorialPower[Total[p], Length[p] - 1]/Apply[Times, Map[Factorial[Count[p, #1]] &, Range[Max[p]]]]; a[n_] := Max[Map[ncsp, Partitions[n]]];
%t A130760 Table[a[n], {n, 0, 20}] (* program fixed by _Vaclav Kotesovec_, Oct 23 2014 *)
%Y A130760 Cf. A102356.
%K A130760 nonn
%O A130760 0,4
%A A130760 _Dan Drake_, Jul 13 2007
%E A130760 More terms from _Vaclav Kotesovec_, Oct 23 2014