A Catalan Beta Function from Figurate Numbers?

Nov 10, 2026lab notes

It’s been a while since I last published anything here in English, but I’ve been writing in Spanish about Diophantine equations and elliptic curves E/QE/\mathbb{Q} attached to figurate numbers, with everything that comes along, Mordell-Weil groups included. I’ve found several corollaries along the way.

Well, what got me going a few weeks ago, and what I’ll develop here, is a simple idea: instead of adding figurate numbers (which is already done, and we’ll see it shortly), let’s multiply them. To be specific, I’m referring to the article on the Wayback Machine called Polygorials by Daniel Dockery.

Separately, on August 16 I released version 1.6 of my Ruby gem for making algorithmic music with Sonic Pi, figurate_numbers. It includes ArithTransform.figuratenomial(n, k, seq), which takes a sequence of figurate numbers seq and constructs a Fibonomial from them.

But since I haven’t yet defined what I mean by figurate number around here, I should start unifying how I write them from now on. The reference I use and will keep using is Figurate Numbers (2012) by Elena Deza and Michel Deza, whose notation I’ll also keep, though for now I’ll stay general.

You can use my library figuratenum on PyPI for the examples below.

pip install figuratenum[figurate-viz]

The versatile figurate number

I call it versatile because I think it’s the most comfortable way to understand it and to communicate it with lots of study techniques. Consider a polynomial f∈Q[X]\mathfrak{f} \in \mathbb{Q}[X] of degree deg⁡(f)=k≥2\deg(\mathfrak{f})= k \ge 2, which plays the role of the geometric dimension (planar, spatial, or multidimensional). It induces a function

f:Z⟶Q,n⟼f(n). \begin{aligned} \mathfrak f:\mathbb Z & \longrightarrow\mathbb Q, \\ n & \longmapsto\mathfrak f(n). \end{aligned}

In particular, if

f(X)=∑j=0kajXj,aj∈Q,ak≠0\mathfrak{f}(X) = \sum_{j=0}^k a_j X^j, \quad a_j \in \mathbb{Q},\quad a_k \neq 0

(only the leading coefficient needs to be nonzero; the triangular numbers, for instance, have a0=0a_0=0), the bilateral sequence induced by f\mathfrak{f} is given by

(f(n))n∈Z=(∑j=0kajnj)n∈Z. \bigl(\mathfrak f(n)\bigr)_{n\in\mathbb Z} = \left( \sum_{j=0}^{k} a_j n^j \right)_{n\in\mathbb Z}.

This is what I understand by a figurate number: in essence, the polynomial that carries its nature. That said, let me move on to the prelude of the topic at hand: first the sum, and then the main course, the multiplication.

Sums of figurate numbers

Probably the most beautiful way to learn what a figurate number is starts with the triangular numbers f(n)=S3(n)\mathfrak{f}(n) = S_3(n), which at bottom are simply a sum

S3(n)=∑j=1nj=1+2+3+⋯+nS_3(n) = \sum_{j=1}^n j = 1 +2 +3 + \cdots + n

and which, by Gauss’s trick, we prove to be

S3(n)=n(n+1)2.S_3(n) = \frac{n(n+1)}{2}.

Remark\textbf{Remark}. In some places you’ll find this written as Tn=S3(n)T_n = S_3(n).

from figuratenum import FigurateNum

seq1 = FigurateNum().triangular()
print([next(seq1) for _ in range(1000)])
# [1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66,
#  78, 91, 105, 120, 136, 153, 171, 190, ...]

The first terms are 1,3,6,10,15,…1,3,6,10,15, \ldots. I also want to show the generating function GS3(z)G_{S_3}(z) here, again with figuratenum.

from figuratenum.figurate_viz import ComplexViz

c = ComplexViz(domain_grid_radius=(2))
c.visualize_plane(
    "triangular", cmap_color="Set3",
    disk_radius=None
)

Triangular numbers with FigurateNum (PyPI) Well, it’s not crazy to wonder: what if we sum these terms again, but now instead of summing jj we sum S3(j)S_3(j)? Of course, we do

∑j=1nS3(j)=S3(1)+S3(2)+⋯+S3(n)\sum_{j=1}^n S_3(j) = S_3(1) + S_3(2) + \cdots + S_3(n)

and with a bit of algebraic manipulation we arrive at the tetrahedral numbers, whose dimension is k=3k=3, reflected in the superscript.

S33(n)=n(n+1)(n+2)6=∑j=1nS3(j)S_3^{3}(n) = \frac{n(n+1)(n+2)}{6} = \sum_{j=1}^n S_3(j)
seq1 = FigurateNum().tetrahedral()
print([next(seq1) for _ in range(1000)])
# [1, 4, 10, 20, 35, 56, 84, 120, 165, 220, 286,
# 364, 455, 560, 680, 816, 969, 1140, 1330, ...]

So the tetrahedral numbers are the additive counterpart of iterated factorials (the multiplicative idea we’ll get to in a moment).

Let’s now take the hexagonal numbers, S6(n)=n(2n−1)S_6(n) = n(2n-1), and apply the same process, which leads to

∑j=1nS6(j)=n(n+1)(4n−1)6=S63(n)\sum_{j=1}^n S_6(j) = \frac{n(n+1)(4n-1)}{6} = S_6^3(n)

which gives the hexagonal pyramidal numbers, also of dimension k=3k=3.

seq1 = FigurateNum().m_pyramidal(6)
print([next(seq1) for _ in range(1000)])
# [1, 7, 22, 50, 95, 161, 252, 372, 525, 715,
# 946, 1222, 1547, 1925, 2360, 2856, 3417, ...]

Their generating function GS6(z)G_{S_6}(z) can also be computed directly with figuratenum:

from figuratenum.figurate_viz import ComplexViz

c = ComplexViz(domain_grid_radius=(2))
c.visualize_plane(
    "hexagonal", cmap_color="Set3",
    disk_radius=None
)

Hexagonal numbers with FigurateNum (PyPI)

You’ll see shortly why I chose the hexagonals. For now, notice that if we take the process to the limit, the ratio of the hexagonal pyramidal numbers to the tetrahedral (triangular pyramidal) ones converges to an integer,

S63(n)S33(n)=4n−1n+2⟶4(n→∞).\frac{S_6^3(n)}{S_3^3(n)} = \frac{4n-1}{n+2} \longrightarrow 4 \quad (n \rightarrow \infty).

In fact, they converge to the same number when evaluating the ratio of hexagonal and triangular numbers,

lim⁡n∞S6(n)S3(n)=4n−1n+1=4.\lim_{n \infty} \frac{S_6(n)}{S_3(n)} = \frac{ 4n-1}{n+1} = 4.

This quotient idea came a little later than what follows, as I wanted to see whether it had anything to do with what makes certain quotients special.

In general, many figurate numbers can be built from combinations, sums, and recursions of other numbers; Figurate Numbers (2012) is a book full of these beautiful constructive ideas.

Let’s get to the main course, the truncated (finite) products.

Products of figurate numbers

Just as we did with the sum, it’s natural to ask: and what if we multiply? So let’s do the same thing

∏j=1nj=n!\prod_{j = 1}^n j = n!

which is the idea of the factorial, but if we want to take the factorial again

∏j=1nj!\prod_{j=1}^n j!

we get the superfactorial. This is, for me, the multiplicative mirror of the tetrahedral numbers. I realized, almost by accident, that we’re iterating, and creating a dual map between the two operations on consecutive natural numbers.

IterationSum of jjProduct of jj
1Triangular numbersFactorial
2Tetrahedral numbersSuperfactorial

What struck me about the table is that what counts is the iteration, additive on one side and multiplicative on the other, much like reductions modulo pp (which have nothing to do with anything here), but I associated them almost spontaneously.

Catalan numbers from planar figurate numbers

I’ve taken the naturals 1,2,3,…1,2,3, \ldots, but it’s natural to start thinking about the same thing with a different sequence.

The triangulars

For example, with the triangular numbers, the terrain expands a bit beyond the simple factorial to combinations of factorials

∏j=1nS3(j)=n!(n+1)!2n\prod_{j=1}^n S_3(j) = \frac{n!(n+1)!}{2^n}

Proof\textit{Proof}. I write out the product of triangular numbers, ∏j=1nj(j+1)2\prod_{j=1}^{n} \frac{j(j+1)}{2}, and directly, expanding into separate products,

12n(∏j=1nj)(∏j=1n(j+1))\frac{1}{2^n} \left(\prod_{j=1}^n j\right) \left(\prod_{j=1}^n(j+1)\right)

which is evidently 12nn!(n+1)!\frac{1}{2^n}n! (n+1)!, as claimed. □\square

The hexagonals

What surprised me on the Wayback Machine was that if I do the same with the hexagonal numbers

∏j=1nS6(j)=(2n)!2n\prod_{j=1}^n S_6(j) = \frac{(2n)!}{2^n}

Proof\textit{Proof}. I expand the figurate numbers ∏j=1nj(2j−1)\prod_{j=1}^n j(2j-1) and separate them as

∏j=1nj∏j=1n(2j−1)\prod_{j=1}^n j \prod_{j=1}^n (2j-1)

On the left I have n!n!, and on the right (1⋅3⋅5⋯(2n−1))(1\cdot 3 \cdot 5 \cdots (2n-1)). Splitting (2n)!(2n)! into its even and odd factors,

(2n)!=(2⋅4⋅6⋯2n)(1⋅3⋅5⋯(2n−1))(2n)! = (2\cdot 4 \cdot 6 \cdots 2n)(1\cdot 3 \cdot 5 \cdots (2n-1))

Since 2⋅4⋅6⋯2n=2nn!2 \cdot 4 \cdot 6 \cdots 2n = 2^n n!, then

(1⋅3⋅5⋯(2n−1))=(2n)!2nn!.(1\cdot 3 \cdot 5 \cdots (2n-1)) = \frac{(2n)!}{2^n n!}.

Finally, multiplying by n!n! and solving, the identity above for the hexagonals is proved. □\square

The Catalan quotient

Why the hexagonal? Well, here’s the answer: just put a quotient of hexagonals over triangulars (where the 2n2^n cancel) and out comes

∏j=1nS6(j)∏j=1nS3(j)=(2n)!n!(n+1)!=Cn\frac{\prod_{j=1}^n S_6(j)}{\prod_{j=1}^n S_3(j)} = \frac{(2n)!}{n!(n+1)!} = C_n

which is the well-known sequence of the Catalan numbers - OEIS A000108, exactly as it appears derived on page 9 of the Polygorials. Its first terms grow like this

1,1,2,5,14,42,132,…1, 1, 2, 5, 14, 42, 132, \ldots

But, as with many of these identities, a few naive exploratory questions come to mind.

A Pic of Catalan numbers in Sonic Pi

Screenshot of an old 2023 photo about the Catalan numbers in Sonic Pi.

What harm could there be in extending this form of the Catalan numbers, a quotient of factorialized triangulars and hexagonals, to the complex numbers?

The Catalan Gamma function

Every time I see a factorial !! I think of the Gamma function Γ\Gamma; as I’ve said many times, this association comes from the very short book by Emil Artin.

What I’ll do is a naive extension from the integers to a complex variable, n↦z∈Cn \mapsto z \in \mathbb{C}. Here, just as a reminder to myself, I write

Γ(z)=∫0∞tz−1e−tdt\Gamma(z) = \int_0^{\infty} t^{z-1}e^{-t}dt

for ℜ(z)>0\Re(z) > 0. Its meromorphic continuation has simple poles at 00 and the negative integers −1,−2,…-1, -2, \ldots and, by the way, it has no zeros (so 1/Γ1/\Gamma is entire). So I rewrite the Catalan sequence over the complex numbers

C(z)=Γ(2z+1)Γ(z+1)Γ(z+2)C(z)=\frac{\Gamma(2z+1)} {\Gamma(z+1)\Gamma(z+2)}

The upside is that we can now plug in non-integer arguments, rational ones to start. Since I also like thinking about the volume of nn-balls, I’ll begin with 12\frac{1}{2}; you’ll see why I said that, and maybe it’s not a good thing.

C(12)=Γ(2)Γ(32)Γ(52)C\left(\frac{1}{2}\right) = \frac{\Gamma(2)}{\Gamma(\frac{3}{2}) \Gamma(\frac{5}{2})}

These values are already tabulated in plenty of sources, and we get

C(12)=1π2⋅3π4=13π8=83πC\left(\frac{1}{2}\right) = \frac{1}{\frac{\sqrt{\pi}}{2}\cdot\frac{3\sqrt{\pi}}{4}} = \frac{1}{\frac{3\pi}{8}} = \frac{8}{3\pi}

The integral

To get back to the explicit continuum, I’ll write the following integral representation of the Catalan numbers (valid for ℜ(x)>−12\Re(x) > -\frac{1}{2}),

C(x)=2⋅4xπ∫01tx−12(1−t)12dtC(x) = \frac{2\cdot 4^x}{\pi} \int_0^1 t^{x - \frac{1}{2}} (1-t)^{\frac{1}{2}} dt

Proof\textit{Proof}. I need three well-known facts. First, by Legendre’s duplication formula,

Γ(z)Γ(z+12)=21−2zπΓ(2z)\Gamma(z) \Gamma(z + \frac{1}{2}) = 2^{1-2z}\sqrt{\pi} \Gamma(2z)

taking z=x+12z = x + \frac{1}{2}, we get

Γ(2x+1)=4xπΓ(x+1)Γ(x+12)\Gamma (2x+1) = \frac{4^x}{\sqrt{\pi}} \Gamma(x+1)\Gamma(x + \frac{1}{2})

From which, partway through solving, it follows that

C(x)=4xΓ(x+12)πΓ(x+2)C(x)= \frac{4^x \Gamma(x + \frac{1}{2})}{\sqrt{\pi}\Gamma(x+2)}

Now I also need this well-known identity for quotients of Gamma

Γ(a)Γ(a+b)=1Γ(b)∫01ta−1(1−t)b−1dt\frac{\Gamma(a)}{\Gamma(a+b)} = \frac{1}{\Gamma(b)} \int_0^1 t^{a-1}(1-t)^{b-1} dt

We know that a=x+12a = x + \frac{1}{2}, and bb has to be determined by the denominator Γ(x+2)\Gamma(x+2), so a+b=x+2a+b = x+2, which means solving x+12+b=x+2x + \frac{1}{2} + b = x+ 2, giving b=32b=\frac{3}{2}. Almost done: since Γ(32)=π2\Gamma(\frac{3}{2}) = \frac{\sqrt{\pi}}{2}, the integral form is proved by substituting aa and bb into the quotient identity. □\square

I switched from zz to xx for the variable because I want to think of a function that goes hand in hand with Γ\Gamma.

The Eulerian Beta function of Catalan

Well, since we already have the Gamma version, it’s natural to say again: what if we build a Euler-type Beta function for it? In other symbols, I’ll write

BC(x,y)=C(x)C(y)C(x+y)B_C(x,y)=\frac{C(x)C(y)}{C(x+y)}

The expanded result is practically direct; it’s enough to substitute everything we did above.

BC(x,y)=Γ(2x+1)Γ(x+1)Γ(x+2)⋅Γ(2y+1)Γ(y+1)Γ(y+2)Γ(2(x+y)+1)Γ(x+y+1)Γ(x+y+2)B_C(x,y)= \frac{ \displaystyle \frac{\Gamma(2x+1)} {\Gamma(x+1)\Gamma(x+2)} \cdot \frac{\Gamma(2y+1)} {\Gamma(y+1)\Gamma(y+2)} }{ \displaystyle \frac{\Gamma(2(x+y)+1)} {\Gamma(x+y+1)\Gamma(x+y+2)} }

With a bit of algebra and a minute of patience, I get

BC(x,y)=Γ(2x+1)Γ(2y+1)Γ(x+y+1)Γ(x+y+2)Γ(x+1)Γ(x+2)Γ(y+1)Γ(y+2)Γ(2x+2y+1)B_C(x,y)= \frac{ \Gamma(2x+1)\Gamma(2y+1) \Gamma(x+y+1)\Gamma(x+y+2) } { \Gamma(x+1)\Gamma(x+2) \Gamma(y+1)\Gamma(y+2) \Gamma(2x+2y+1) }

It landed in my lap like a gift. Now, it has the most expected properties of such a function; for example, it’s symmetric, that is, BC(x,y)=BC(y,x) B_C(x,y) = B_C(y, x). With a nose for algebra, I also get BC(x,0)=C(0)=1B_C(x, 0) = C(0) = 1. And above all, the associativity-type identity (the same one the classical Beta satisfies)

BC(x,y)BC(x+y,z)=BC(y,z)BC(x,y+z)B_C(x,y)B_C(x+y,z) = B_C(y,z)B_C(x, y+z)

By its very definition, this construction is also a multiplicative 22-coboundary, and therefore satisfies the corresponding 22-cocycle identity. But let’s not get sidetracked.

Something I could study in the future would be the special values. For example, if we plug in x=y=12x = y = \frac{1}{2}, we get BC(12,12)=649π2B_C\left(\frac{1}{2}, \frac{1}{2}\right) = \frac{64}{9\pi^2}.

Integral of the Catalan pseudo-beta

Since we’ve already made the Gamma function explicit, let me also recall the traditional Euler Beta

B(x,y)=∫01tx−1(1−t)y−1dtB(x,y) = \int_0^1 t^{x-1}(1-t)^{y-1} dt

Now, to get an integral form for BC(x,y)B_C(x,y) it will again be somewhat tedious, but I can rewrite everything using what we did above.

BC(x,y)=(2⋅4xπ∫01tx−12(1−t)12dt)(2⋅4yπ∫01sy−12(1−s)12ds)2⋅4x+yπ∫01ux+y−12(1−u)12duB_C(x,y) = \frac{ \left( \frac{2\cdot 4^x}{\pi} \int_0^1 t^{x - \frac{1}{2}} (1-t)^{\frac{1}{2}} dt\right) \left( \frac{2\cdot 4^y}{\pi} \int_0^1 s^{y - \frac{1}{2}} (1-s)^{\frac{1}{2}} ds \right) } { \frac{2\cdot 4^{x+y}}{\pi} \int_0^1 u^{x+y - \frac{1}{2}} (1-u)^{\frac{1}{2}} du }

To wrap up, we’d still need to simplify by cancelling a few terms, namely, (2⋅4x)(2⋅4y)2⋅4x+y=2,\frac{(2\cdot 4^x)(2\cdot 4^y)}{2\cdot 4^{x+y}} = 2, and the powers of π\pi leave one factor 1π\frac{1}{\pi}. So the identity simply becomes

BC(x,y)=2π(∫01tx−12(1−t)12dt)(∫01sy−12(1−s)12ds)∫01ux+y−12(1−u)12duB_C(x,y) = \frac{2}{\pi} \frac{ \left( \int_0^1 t^{x - \frac{1}{2}} (1-t)^{\frac{1}{2}} dt\right) \left( \int_0^1 s^{y - \frac{1}{2}} (1-s)^{\frac{1}{2}} ds \right) } { \int_0^1 u^{x+y - \frac{1}{2}} (1-u)^{\frac{1}{2}} du }

My idea would be to write it as a single integral rather than a quotient, but I think I’ll leave that for another time.

Catalan numbers from the classical Beta function

For a bit of variety, I’ll plot both functions in the complex plane using the cplot library. For the moment I have to think about whether to implement these Gamma factorials visually in C\mathbb{C} in figuratenum, so nothing is available to date.

Well, going back to the beginning to deal with the triangular polygorial in terms of the Gamma function

Γ(n+1)Γ(n+2)2n=∏j=1nS3(j)\frac{\Gamma(n+1)\Gamma(n+2)}{2^n} = \prod_{j=1}^n S_3(j)

Gamma of Triangular Numbers

and, similarly, the hexagonal polygorial

Γ(2n+1)2n=∏j=1nS6(j).\frac{\Gamma(2n+1)}{2^n} = \prod_{j=1}^n S_6(j).

Gamma of Hexagonal Numbers

Curiously, if we take the quotient again we arrive at C(z)C(z). Nevertheless, I want to do something different with this game of identities. In that spirit, by the classical identity (I’ll use a,ba,b, but it’s the same as x,yx,y), B(a,b)B(a,b), and setting a=n+1a = n+1 and b=n+2b = n+2, this becomes

B(n+1,n+2)=Γ(n+1)Γ(n+2)Γ(2n+3)B(n+1, n+2) = \frac{\Gamma(n+1)\Gamma(n+2)}{\Gamma(2n+3)}

Since we want to reach the Catalan function in terms of Gamma, which was (I’ll write it again)

Cn=Γ(2n+1)Γ(n+1)Γ(n+2)C_n = \frac{\Gamma(2n+1)}{\Gamma(n+1)\Gamma(n+2)}

If you look closely, it’s quite similar but upside down. So I invert the expression we just computed to make it resemble this one

1B(n+1,n+2)=Γ(2n+3)Γ(n+1)Γ(n+2)\frac{1}{B(n+1, n+2)} = \frac{\Gamma(2n+3)}{\Gamma(n+1)\Gamma(n+2)}

How do we convert it to match? Well, among the thousands of properties of Gamma, there’s the functional equation

Γ(2n+3)=(2n+2)(2n+1)Γ(2n+1),\Gamma(2n+3) = (2n+ 2)(2n+ 1) \Gamma(2n+1),

Therefore, check this out

1B(n+1,n+2)=(2n+2)(2n+1)Cn\frac{1}{B(n+1, n+2)} = (2n+2)(2n+1)C_n

So the Catalan numbers are

Cn=1(2n+1)(2n+2)B(n+1,n+2)C_n = \frac{1}{(2n+1)(2n+2)B(n+1, n+2)}

The beautiful part is that the factor multiplying the Beta in the denominator is a quadratic polynomial in nn, namely

(2n+1)(2n+2)=4n2+6n+2=L(n)(2n+1)(2n+2) = 4n^2 + 6n + 2 = L(n)

If I evaluate the first terms of L(n)L(n), with n≥1n \ge 1,

12,30,56,90,132,182,240,306,380,46212, 30, 56, 90, 132, 182, 240, 306, 380, 462

By one of life’s coincidences, it’s exactly the same sequence that appears in

starting at index 22. But it’s identical if we evaluate L(n)L(n) at values n≥−1n \ge -1, that is, it produces 0,2,12,30,…0, 2, 12, 30, \ldots

A small proposal to look into

After all these identities, and since the quotient of the products of S6S_6 over S3S_3 generates a sequence as combinatorially important as the Catalan numbers,

Which other quotients or products can generate a number or pattern with an interesting combinatorial meaning, let’s call it Λ(n)\Lambda(n), and what are the conditions for that to happen?

That is, if we have two figurate numbers of equal or different dimensions k1k_1 and k2k_2,

∏j=1nfk1(j)∏j=1nfk2(j)=Λ(n)\frac{\prod_{j=1}^n \mathfrak{f}^{k_1}(j)}{ \prod_{j=1}^n \mathfrak{f}^{k_2}(j)} = \Lambda(n)

As I wrote above, I only tested whether it depended on the limiting process and convergence while keeping the integer condition. However, in both dimensions k=2k=2 and k=3k=3, the ratio S6kS3k\frac{S_6^k}{ S_3^k} converge to 44. But when taking the product, only the two-dimensional case turns out to be a gem. What other related aspects could I explore? I could try this in dimension k=2k=2, exploring different pairs of figurate numbers whose ratio converges to an integer. I might give that a try sometime.

Handwritten notes on the Gamma and Beta functions through figurate numbers.

A glimpse of my notebook, where I was already thinking about an iterated, superfactorial-like form of figurate numbers. The hyperbola and the logarithm lie at the heart of all these mappings.

I’ll leave these identities and the quotient of two polygorials here, along with its naive pseudo-Beta function.

Table of Contents
Profile Photo of Edgar Delgado Vega
Written by
Edgar Delgado Vega
Mathematical music geek, open-source tool builder, quirky thinker.
© 2026 Edgar Delgado Vega