Lindelöf representations and (non-)holonomic sequences (Q2380433)

A sequence \((f_n)_{ n \geq 0 }\) is \textit{holonomic} (or \textit{P-recursive}) if \[ p_0(n) f_{ n+d } + p_1(n) f_{ n+d-1 } + \cdots + p_d(n) f_n = 0 , \qquad n \geq 0, \] for some polynomials \(p_j\). Many combinatorial sequences of common interest, e.g., a wide class of sums involving binomial coefficients, are holonomic. The article constructs an complex-analytic machinery (structure theorem for singularities of solutions to linear differential equation, Abelian theorem) for proving that a sequence is \textit{not} holonomic. It confirms three open conjectures, namely that the sequences \((\log n)\), \(( n^\alpha)\) for a fixed \(\alpha \in {\mathbb C} \setminus {\mathbb Z}\), and the sequence of primes is not holonomic.