/- 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

The generating function $A(x)=1+3xA(x)^2-2xA(-x)^2$

The sequence consists of the coefficients of $A(x)=1+3xA(x)^2-2xA(-x)^2$.

References:

@[expose] public sectionnamespace OeisA368635

Coefficients of the square of a power series with coefficient sequence $b$.

def conv2 (b : ℕ → ℕ) (n : ℕ) : ℕ := ∑ k ∈ Finset.range (n + 1), b k * b (n - k)

Coefficients of $A(x)=1+3xA(x)^2-2xA(-x)^2$.

def a : ℕ → ℕ := Nat.strongRec fun n ih => if n = 0 then 1 else let b : ℕ → ℕ := fun m => if h : m < n then ih m h else 0 (if Even n then 5 else 1) * conv2 b (n - 1)

The coefficient recurrence unfolded at an index.

n:ℕ⊢ (if n = 0 then 1 else have b := fun m ↦ if h : m < n then (fun m x ↦ Nat.strongRec (fun n ih ↦ if n = 0 then 1 else have b := fun m ↦ if h : m < n then ih m h else 0; (if Even n then 5 else 1) * conv2 b (n - 1)) m) m h else 0; (if Even n then 5 else 1) * conv2 b (n - 1)) = if n = 0 then 1 else (if Even n then 5 else 1) * conv2 (fun m ↦ if m < n then a m else 0) (n - 1) All goals completed! 🐙⊢ (if 0 = 0 then 1 else (if Even 0 then 5 else 1) * conv2 (fun m ↦ if m < 0 then a m else 0) (0 - 1)) = 1 All goals completed! 🐙⊢ (if 1 = 0 then 1 else (if Even 1 then 5 else 1) * conv2 (fun m ↦ if m < 1 then a m else 0) (1 - 1)) = 1 All goals completed! 🐙⊢ (if 2 = 0 then 1 else (if Even 2 then 5 else 1) * conv2 (fun m ↦ if m < 2 then a m else 0) (2 - 1)) = 10 All goals completed! 🐙⊢ (if 3 = 0 then 1 else (if Even 3 then 5 else 1) * conv2 (fun m ↦ if m < 3 then a m else 0) (3 - 1)) = 21 All goals completed! 🐙⊢ (if 4 = 0 then 1 else (if Even 4 then 5 else 1) * conv2 (fun m ↦ if m < 4 then a m else 0) (4 - 1)) = 310 All goals completed! 🐙⊢ (if 5 = 0 then 1 else (if Even 5 then 5 else 1) * conv2 (fun m ↦ if m < 5 then a m else 0) (5 - 1)) = 762 All goals completed! 🐙

"Conjecture: $a(n)$ is odd when $n = 2^k - 1$ for $k \ge 0$, and even elsewhere."

    Paul D. Hanna, Jan 12 2024.

Lean proof by Wentao Li, with AI assistance; see [Li26].

@[category research solved, AMS 11, formal_proof using lean4 at "https://github.com/VictorLiwentao/lean-oeis-proofs/blob/9d4a205da2a4094800f9c600a7b0b5223eda51ce/LeanOeisProofs/NewFormalization/A368635.lean#L433"] theorem conjecture (n : ℕ) : Odd (a n) ↔ ∃ k : ℕ, n = 2 ^ k - 1 := n:ℕ⊢ Odd (a n) ↔ ∃ k, n = 2 ^ k - 1 All goals completed! 🐙end OeisA368635