<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Partition of a set - Page 18 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Partition_of_a_set&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Partition_of_a_set&amp;p=19">3.Next</a>
</p>
<p>the previous row, and subsequent values are computed by adding two numbers, the number to the left and the number to the above left of the position. The Bell numbers are repeated along both sides of this triangle. The numbers within the triangle count partitions in which a given element is the largest <a href="page.php?w=singleton_%28mathematics%29">singleton</a>.</p>

<p>The number of partitions of an n-element set into exactly k (non-empty) parts is the <a href="page.php?w=Stirling_number_of_the_second_kind">Stirling number of the second kind</a></p><p>
<a accesskey="1" href="page.php?w=Partition_of_a_set&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Partition_of_a_set&amp;p=19">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
