/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Recurrence with fourth powers of binomial coefficients

The sequence is defined by $a(1) = 2$, and for $n \ge 2$, $$(2n+1)^3 a(n) = 32n^3 a(n-1) + (21n^3 + 22n^2 + 8n + 1) \binom{2n-1}{n}^4.$$

References:

    A176477

    Z.-W. Sun, "Open Conjectures on Congruences", arXiv preprint arXiv:0911.5665 [math.NT], 2009-2011.

    T. Adamczewski, "OEIS Open: How many conjectures can language models turn into theorems?", arXiv:2608.11941 [cs.AI], 2026.

@[expose] public sectionnamespace OeisA176477

Rational recurrence sequence $a(n)$.

def a : ℕ → ℚ | 0 => 0 | 1 => 2 | n + 2 => let idx : ℚ := n + 2 let prev := a (n + 1) (32 * idx ^ 3 * prev + (21 * idx ^ 3 + 22 * idx ^ 2 + 8 * idx + 1) * ((2 * (n + 2) - 1).choose (n + 2) : ℚ) ^ 4) / (2 * idx + 1) ^ 3

Value of the sequence a at 1.

@[category test, AMS 11] theorem a_1 : a 1 = 2 := ⊢ a 1 = 2 All goals completed! 🐙

Value of the sequence a at 2.

@[category test, AMS 11] theorem a_2 : a 2 = 181 := ⊢ a 2 = 181 All goals completed! 🐙

Each term $a(n)$ is a positive integer.

    Zhi-Wei Sun, Apr 06 2010

Proved in the OEIS Open project, see T. Adamczewski, OEIS Open: How many conjectures can language models turn into theorems?, arXiv:2608.11941.

@[category research solved, AMS 11, formal_proof using lean4 at "https://github.com/epoch-research/LeanOpenProblems-results/blob/fd09021e79869476ef83cda231312f1a2a89c8d7/runs/oeis-open-lite-gpt6astra-37ly1phzfwj2ech4/oeis_a176477_conjecture/Submission/Spec.lean#L58383"] theorem conjecture1 (n : ℕ) (hn : 1 ≤ n) : (a n).den = 1 ∧ 0 < a n := n:ℕhn:1 ≤ n⊢ (a n).den = 1 ∧ 0 < a n All goals completed! 🐙

$a(n)$ is odd if and only if $n = 2, 2^2, 2^3, \dots$.

    Zhi-Wei Sun, Apr 06 2010

Proved in the OEIS Open project, see T. Adamczewski, OEIS Open: How many conjectures can language models turn into theorems?, arXiv:2608.11941.

@[category research solved, AMS 11, formal_proof using lean4 at "https://github.com/epoch-research/LeanOpenProblems-results/blob/fd09021e79869476ef83cda231312f1a2a89c8d7/runs/oeis-open-lite-gpt6astra-37ly1phzfwj2ech4/oeis_a176477_conjecture/Submission/Spec.lean#L58383"] theorem conjecture2 (n : ℕ) (hn : 1 ≤ n) : ((a n).den = 1 ∧ Odd (a n).num) ↔ ∃ m : ℕ, 1 ≤ m ∧ n = 2 ^ m := n:ℕhn:1 ≤ n⊢ (a n).den = 1 ∧ Odd (a n).num ↔ ∃ m, 1 ≤ m ∧ n = 2 ^ m All goals completed! 🐙end OeisA176477