Extended Central Factorial Numbers and the Flickering Operator
Andrii Husiev

TL;DR
This paper introduces the flickering operator, a new recursive framework for extended central factorial numbers that unifies various combinatorial sequences and offers an integer-based power sum expansion.
Contribution
The study presents a novel flickering operator that unifies multiple combinatorial sequences into a single recursive framework, avoiding fractional Bernoulli numbers.
Findings
Provides explicit closed-form expressions for the extended central factorial numbers.
Demonstrates the flickering operator's ability to generate complete integer sequences.
Offers a Python implementation of the proposed framework.
Abstract
This paper introduces a class of extended central factorial numbers generated by a parity-dependent recurrence relation, termed the "flickering operator". We demonstrate that the resulting triangular structure, now indexed as OEIS A395021, provides a unified recursive framework for alternating bit sequences (A000975) and normalized tangent-secant coefficients (A036969). This study provides an alternative integer-based expansion for power sums. While similar to the central factorial methods explored by Knuth (1993), our flickering basis offers an integrated computational scheme that avoids fractional Bernoulli numbers by construction. We provide explicit closed-form expressions, discuss its geometric derivation from finite difference tables, and present a full Python implementation. Structural Synthesis. A key contribution of this work is the unification of previously disparate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
