Naively generating Catalan numbers in Haskell

Dyck paths visualizer built with DOM methods

CIDER: Scheme-routines that take as their input parenthesizations (S-expressions) and output their various Catalan manifestations as Encapsulated Postscript

Diploma Thesis on Graph Drawing Algorithms with Python

Generation of Catalan numbers with Haskell

A trial Clojure project for a blog post about the Catalan numbers.

Converts number to text (Catalan language)

This repository contains a Python script that calculates the digits of π (pi) using a novel algorithm based on Catalan numbers and fixed-point arithmetic. The algorithm efficiently computes the digits of π by leveraging the properties of Catalan numbers, making it a unique and effective method for high-precision calculations.

Python script for drawing "Wolframesque" images (like in Wolfram's magnus opus New Kind of Science) of various iterated systems based on Catalan bijections applied repeatedly to a Dyck path (or equivalently, a rooted binary tree) whose size is increased at each iteration.

non crossing perfect matching utilized for randomly-generated tesselations

Visualizing Catalan numbers

Here are some dynamic programming problem solutions.

Two programs that illustrate the creation of OEIS array A089840, which lists signature permutations of non-recursive Catalan automorphisms, that is, bijections of finite plane binary trees, with no unlimited recursion down to indefinite distances from the root.

IntSeq - Integer Sequence & Transformation library for Scheme