/- 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. -/ import FormalConjecturesUtil

$a(n) = \operatorname{lcm}{1,2,\dots,n}/\operatorname{denom}(H(n))$

References:

namespace OeisA110566open Nat Finset Rat

The primary defining sequence a. $a(n) = \frac{\operatorname{lcm}_{k=1}^n k}{\operatorname{den}(H_n)}$

def a (n : ) : := (Icc 1 n).lcm id / (harmonic n).den

Term theorems verifying the first few values of the sequence against the official OEIS b-file

@[category test, AMS 11] theorem a_1 : a 1 = 1 := a 1 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_2 : a 2 = 1 := a 2 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_3 : a 3 = 1 := a 3 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_4 : a 4 = 1 := a 4 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_5 : a 5 = 1 := a 5 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_6 : a 6 = 3 := a 6 = 3 All goals completed! 🐙

It is conjectured that every odd number occurs in this sequence.

@[category research open, AMS 11] theorem conjecture : m : , Odd m n > 0, a n = m := (m : ), Odd m n > 0, OeisA110566.a n = m All goals completed! 🐙end OeisA110566