A394082 - OEIS

%I #25 Jun 14 2026 15:57:03

%S 1,12344,2408941884,894971463204720,446324644841317281200,

%T 263656050352833337510832640,173882340006327290808417397911384,

%U 123903876312804417119950974199179053760,93504544544138169501999410471960172058628640,73755525269360717394343255792950241790850509604000

%N Diagonal of the 4-dimensional geode array: a(n) = G(n,n,n,n).

%C The geode G is a 4-dimensional array of positive integers introduced by Wildberger and Rubine (2025) via operator inversion of the hyper-Catalan generating series. If S denotes the hyper-Catalan series in variables t_2, t_3, t_4, t_5, then S - 1 = (t_2 + t_3 + t_4 + t_5) * G. This sequence records the main diagonal a(n) = G(n,n,n,n).

%C Every geode entry G(m2,m3,m4,m5) can be expressed as a closed-form alternating multinomial sum of hyper-Catalan numbers (Kotlarz, 2026). The proof follows by formally inverting the geode recurrence via a Neumann series and expanding with the multinomial theorem.

%C The hyper-Catalan number C(m2,m3,m4,m5) counts subdivisions of a roofed convex polygon into m2 triangles, m3 quadrilaterals, m4 pentagons, and m5 hexagons (Erdelyi and Etherington, 1940). Its closed form is C(m2,m3,m4,m5) = (S+L-1)! / (m2! * m3! * m4! * m5! * L!) where S = m2+m3+m4+m5 and L = m2 + 2*m3 + 3*m4 + 4*m5 + 1.

%C Combinatorial interpretation (Kotlarz, 2026): G(m2,m3,m4,m5) counts exactly the ballot sequences (Lukasiewicz words) of type (m2+1,m3,m4,m5) in which the first negative step is -1. Equivalently, no step of value -k (k >= 2) precedes the first step of value -1. Equivalently, in the corresponding ordered tree (via the Lukasiewicz bijection), no node of arity r >= 3 whose first r-2 children are all leaves precedes the first binary node in pre-order.

%C The value G(1000,1000,1000,1000) (a 6303-digit integer) was computed by Rubine in December 2025, claiming a $100 prize offered by Amdeberhan, Kauers, and Zeilberger in arXiv:2508.10245.

%C Amdeberhan, Kauers, and Zeilberger (arXiv:2508.10245) found a second-order holonomic recurrence for the 3-dimensional diagonal G(n,n,n) (with degree-35 polynomial coefficients) but were unable to find one for the 4-dimensional case. By Lipshitz's theorem the diagonal is D-finite, so such a recurrence exists but likely has very high order and degree.

%C Empirical: Numerical fitting of 120 terms suggests a(n) ~ K * alpha^n * n^beta where beta = -3.000 to at least 3 decimal places. The exponential base alpha has not fully converged at n=119 (successive ratios a(n+1)/a(n) ~ 1083000 and increasing); it is conjectured to be 14^14/10^10 = 1111200.6826... based on saddle-point heuristics.

%H T. Amdeberhan, M. Kauers, and D. Zeilberger, <a href="https://arxiv.org/abs/2508.10245">The Challenge of Computing Geode Numbers</a>, arXiv:2508.10245 [math.CO], 2025; Palestine J. Math. 14(4) (2025), 709-713.

%H T. Amdeberhan and D. Zeilberger, <a href="https://arxiv.org/abs/2506.17862">Proofs Of Three Geode Conjectures</a>, arXiv:2506.17862 [math.CO], 2025.

%H I. M. Gessel, <a href="https://arxiv.org/abs/2507.09405">Lattice Paths and the Geode</a>, arXiv:2507.09405 [math.CO], 2025.

%H M. Gossow, <a href="https://arxiv.org/abs/2507.18097">Ordered Trees and the Geode</a>, arXiv:2507.18097 [math.CO], 2025.

%H D. Rubine, <a href="https://arxiv.org/abs/2507.04552">Hyper-Catalan and Geode Recurrences and Three Conjectures of Wildberger</a>, arXiv:2507.04552 [math.CO], 2025.

%H D. Rubine, <a href="https://arxiv.org/abs/2512.21785">Computing the 4D Geode</a>, arXiv:2512.21785 [math.CO], 2025.

%H N. J. Wildberger and D. Rubine, <a href="https://doi.org/10.1080/00029890.2025.2460966">A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode</a>, Amer. Math. Monthly, 132(5) (2025), 420-437.

%F a(n) = G(n,n,n,n) where G(m2,m3,m4,m5) = Sum_{i=0..m3} Sum_{j=0..m4} Sum_{k=0..m5} (-1)^{i+j+k} * ((i+j+k)!/(i!*j!*k!)) * C(m2+1+i+j+k, m3-i, m4-j, m5-k), where C(m2,m3,m4,m5) = (S+L-1)!/(m2!*m3!*m4!*m5!*L!) with S = m2+m3+m4+m5, L = m2+2*m3+3*m4+4*m5+1.

%F Equivalently, G satisfies the recurrence G(m2,m3,m4,m5) = C(m2+1,m3,m4,m5) - G(m2+1,m3-1,m4,m5) - G(m2+1,m3,m4-1,m5) - G(m2+1,m3,m4,m5-1) (nonnegative indices only).

%e For n=1, a(1) = G(1,1,1,1) = 12344. This counts the ballot sequences of type (2,1,1,1) whose first negative step is -1.

%o (Python) # Direct sum formula

%o from math import factorial

%o def C(m2, m3, m4, m5):

%o     S, L = m2+m3+m4+m5, m2+2*m3+3*m4+4*m5+1

%o     return factorial(S+L-1) // (factorial(m2)*factorial(m3)*factorial(m4)*factorial(m5)*factorial(L))

%o def a(n):

%o     res = 0

%o     for i in range(n+1):

%o         for j in range(n+1):

%o             for k in range(n+1):

%o                 t = factorial(i+j+k)//(factorial(i)*factorial(j)*factorial(k)) * C(n+1+i+j+k, n-i, n-j, n-k)

%o                 res += t if (i+j+k)%2==0 else -t

%o     return res

%o print([a(n) for n in range(8)])

%Y Cf. A000108 (first column of 2-dimensional geode), A001764 (first row of 2-dimensional geode), A104978, A383439 (diagonal of 2-dimensional geode), A383450, A383451.

%K nonn

%O 0,2

%A _Steven Kotlarz_, Mar 09 2026