# $Id: README,v 1.1 2004/09/02 22:48:10 trammell Exp $

# The method I tried here stemmed from my first pencil-and-paper
# algorithm, which was flawed, but had the seed of a good idea.
# 
# I had noticed:
#   1: ()                        call this "1"
#   2: ()(), (())                which is 11, (1)
#   3: ((())), (())(), ()(()),   which is (2), 12, 21
#      ()()(), (()())
#
# So I thought a simple recursion existed: to find the values of N+1,
# just construct:
#
#    map { ("()$_", "($_)", "$_()") } @n
#
# This breaks down rapidly, and fails to catch the (())(()) entry for
# N=4.
#