bell_numbers.pl

#!/usr/bin/perl

# Fast algorithm for computing the first n Bell numbers, using Aitken's array.

# See also:
#   https://en.wikipedia.org/wiki/Bell_number

use 5.020;
use strict;
use warnings;

use experimental qw(signatures);
## use Math::AnyNum qw(:overload);

sub bell_numbers ($n) {

    my @acc;
    my @bell = (1);

    foreach my $k (1 .. $n) {

        my $t = $bell[-1];

        foreach my $i (0 .. $#acc) {
            $t += $acc[$i];
            $acc[$i] = $t;
        }

        unshift(@acc, $bell[-1]);
        push @bell, $acc[-1];
    }

    @bell;
}

say join ', ', bell_numbers(15);

__END__
1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678570, 4213597, 27644437, 190899322, 1382958545