Problem Statement

Bell or exponential numbers are enumerations of the number of different ways to partition a set that has exactly n elements. Each element of the sequence Bn is the number of partitions of a set of size n where order of the elements and order of the partitions are non-significant. E.G.: {a b} is the same as {b a} and {a} {b} is the same as {b} {a}.

A simple way to find the Bell numbers is construct a Bell triangle, also known as an Aitken's array or Peirce triangle, and read off the numbers in the first column of each row. There are other generating algorithms though, and you are free to choose the best / most appropriate for your case.

Write a routine (function, generator, whatever) to generate the Bell number sequence and call the routine to show here, on this page at least the first 15 and (if your language supports big Integers) 50th elements of the sequence. If you do use the Bell triangle method to generate the numbers, also show the first ten rows of the Bell triangle.

Let's start with the solution:

local fn BellNumbers( limit as long )
  long j, n = 1
  
  mda(0) = 1
  printf @"%2llu. %19llu", n, mda_integer(0)
  while ( n < limit )
    mda(n) = mda(0)
    for j = n to 1 step -1
      mda(j - 1) = mda_integer(j - 1) + mda_integer(j)
    next
    n++
    printf @"%2llu. %19llu", n, mda_integer(0)
  wend
end fn

fn BellNumbers( 25 )

HandleEvents