2025/12/04 by Pirayvatloo, Kamyar Sepehri, Azar, Kazem Haghnejad
#FOS: Mathematics #General Mathematics (math.GM)
paper · doi:10.48550/arxiv.2512.06028
In this paper, for every n ∈ ℕ, the following relationships between the functions Kb(n) and Ke(n) and the Bernoulli and Euler numbers are proved: B2n = - \frac(2n)!22n-2 Kb(n), E2n = (2n)! Ke(n). The functions Kb and Ke are defined recursively by Kb(0) = Ke(0) = 1, Kb(n) = - ∑n'=0 n-1 \fracKb(n')( 2(n-n') + 1 )!, n ≥ 1, Ke(n) = - ∑n'=0 n-1 \fracKe(n')( 2(n-n') )!, n ≥ 1. Furthermore, we present combinatorial interpretations of these functions in terms of ordered partitions of n: Kb(n) = ∑λ\vDash n \frac(-1)ℓ(λ) ∏i=1ℓ(λ) (2bi + 1)!, n ≥ 1, Ke(n) = ∑λ\vDash n \frac(-1)ℓ(λ) ∏i=1ℓ(λ) (2bi)!, n ≥ 1, where λ= (b1,b2,…,bk) \vDash n and ℓ(λ)=k.