Combinatorics.BellNumbers
>>> import qualified Combinatorics.BellNumbers as Bell >>> import Test.Utility (equalFuncList)
>>>
import qualified Combinatorics.BellNumbers as Bell
import Test.Utility (equalFuncList)
bellRec :: Num a => [a] Source #
List of Bell numbers computed with the recursive formula given in Wurzel 2004-06, page 136
bellSeries :: (Floating a, Enum a) => Int -> a Source #
equalFuncList (\k -> round (Bell.bellSeries (fromInteger k) :: Double)) (Bell.bellRec :: [Integer]) 20