Quadratic sequences with prime power discriminators

The discriminator of an integer sequence $\textbf{s} = (s(i))_{i \geq 0}$, introduced by Arnold, Benkoski, and McCabe in 1985, is the function $D_{\textbf{s}} (n)$ that sends $n$ to the least integer $m$ such that the numbers $s(0), s(1), \ldots, s(n - 1)$ are pairwise incongruent modulo $m$. In this note, we explore the quadratic sequences whose discriminator is given by $p^{\lceil \log_p n \rceil}$ for prime $p$, i.e., the smallest power of $p$ which is $\geq n$. We provide a complete characterization of such sequences for $p = 2$, show that this is impossible for $p \geq 5$, and provide some partial results for $p = 3$.