Answers are grounded in this paper and cite their sources.
We resolve three open problems recorded in the On-Line Encyclopedia of Integer Sequences (OEIS). First, for n >= 1, let A387569(n) denote the least positive integer y for which there exists an integer x such that C(x + i*y, n) lies in the Gaussian integers Z[i]. Using local completions of Z[i], we prove that primes p == 1 (mod 4) never divide A387569(n), establish periodicity in x, prove that C(x + i*y, n) is in Z[i] for some integer x if and only if A387569(n) divides y, and derive an explicit prime-power formula valid for all n >= 1, extending the known table beyond n = 23. Second, for A392059(n), we prove that A392059(n) is the minimal universal integrality period over all integers x, establish a horizontal Sierpinski translation identity modulo (1+i), disprove the conjecture in OEIS A392059 for every n >= 1 via an explicit counterexample, and prove that the true minimal period modulo (1+i) is 2 * A392059(n). Third, we prove both conjectures of Manyama (2026) on OEIS A179967 enumerating permutations p of [2n+9] with |p(j) - p(j-1)| > n via an exact quotient reduction to a closed 193-dimensional transfer operator and Krylov subspace annihilation. AI Provenance Disclosure: All mathematical analyses, proofs, counterexamples, transfer-operator constructions, verification scripts, and manuscript prose in this work were 100% generated by Google Gemini (gemini-4-carbon) under a confidential prompting configuration operated by the depositor. Complete prompt-independent verification is provided by the self-contained proofs and the standalone exact-arithmetic Python script in Appendix A.
No takes yet. Share an insight, caveat, or question.
Seon-Woo Hong (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: