Parallel enumeration of restricted growth strings, using MPI

A152139(116)=7897, says Orac (64 processors using MPI), after enumerating 163305339345225 restricted growth strings.
http://oeis.org/A152139
Thanks to Joerg Arndt for the original code from FXT.

I’m intending to write this up in about a month’s time.  In the meantime, see “A conjecture on the alphabet size needed to produce all correlation classes of pairs of words”, ACCMCC, 2010.

Tags: combinatorics, MPI, OEIS, strings, words