Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Oudra’s formula for A248186

Abstract

Oudra’s cubic floor formula for the least reciprocal-product threshold index.

Definition 1.1 (The finite-sum residual).

Formalization. D5/S3/ArithSums/OudraA248186CubicFloor.residual (✓ std3).

Citation. Clark Kimberling; Ridouane Oudra (2023). OEIS A248186, least reciprocal-product threshold index. URL: https://oeis.org/A248186/internal.

Commentary.

OEIS A248186 revision 18, NAME (%N; unpaginated): Least k such that 1/18 - Sum_{h=1..k} 1/(h*(h+1)(h+2)(h+3)) < 1/n^3. The sum runs over natural h from 1 through k, including both endpoints; all summands and the subtraction are real-valued. At k=0 the sum is empty.

Definition 1.2 (The real cubic-root constant).

Formalization. D5/S3/ArithSums/OudraA248186CubicFloor.r (✓ std3).

Citation. Clark Kimberling; Ridouane Oudra (2023). OEIS A248186, least reciprocal-product threshold index. URL: https://oeis.org/A248186/internal.

Commentary.

OEIS A248186 revision 18, FORMULA (%F; unpaginated): Conjecture: a(n) = floor(r*n + r^2/n - 1), where r = 3^(-1/3), for n > 2. - Ridouane Oudra, Oct 06 2023 The fixed positive base 3 is raised to the real exponent -1/3.

Definition 1.3 (The least positive threshold sequence).

Formalization. D5/S3/ArithSums/OudraA248186CubicFloor.IsSourceSequence (✓ std3).

Citation. Clark Kimberling; Ridouane Oudra (2023). OEIS A248186, least reciprocal-product threshold index. URL: https://oeis.org/A248186/internal.

Commentary.

OEIS A248186 revision 18, NAME (%N; unpaginated): Least k such that 1/18 - Sum_{h=1..k} 1/(h*(h+1)(h+2)(h+3)) < 1/n^3. The source program searches Range[z], hence positive k. The offset is 1,5; n ranges over positive natural numbers, and A(0) is unconstrained. IsLeast requires both membership and minimality; the comparison is strict. The initial values are a(1)=a(2)=1.

Definition 1.4 (The source assertion with sequence existence).

Formalization. D5/S3/ArithSums/OudraA248186CubicFloor.claim (✓ std3).

Citation. Clark Kimberling; Ridouane Oudra (2023). OEIS A248186, least reciprocal-product threshold index. URL: https://oeis.org/A248186/internal.

Commentary.

OEIS A248186 revision 18, FORMULA (%F; unpaginated): Conjecture: a(n) = floor(r*n + r^2/n - 1), where r = 3^(-1/3), for n > 2. - Ridouane Oudra, Oct 06 2023 A is natural-valued. Its term is cast into the integers before comparison with Int.floor; n is cast into the reals in the formula. Existence is asserted for all positive n, and the formula is asserted for every such sequence at n>2.

Theorem 1.5 (Oudra’s formula holds).

Proof. Machine-checked in Lean as D5/S3/ArithSums/OudraA248186CubicFloor.result (✓ std3). ∎

Resolves. Problems/oudra-a248186-cubic-floor (proved) by D5/S3/ArithSums/OudraA248186CubicFloor.result.

Source. Repository-derived.

Acknowledgement. Clark Kimberling; Ridouane Oudra (2023). OEIS A248186, least reciprocal-product threshold index. URL: https://oeis.org/A248186/internal.

Commentary.

Finite telescoping gives residual(k)=1/(3*(k+1)(k+2)(k+3)). Writing x=rn and b=x+r^2/n, the identity r^3=1/3 gives 3(b^3-b)=n^3+1/(3n^3). For n>2 this lies strictly between n^3 and n^3+1. The polynomial 3(y^3-y) is strictly increasing for y>=1. Its value at the integer floor of b is an integer, so it is at most n^3; its value at floor(b)+1 exceeds n^3. These bounds identify floor(b)-1 as the least positive admissible index. Translation of the floor by the integer one yields the displayed expression. For n=1 and n=2 the least index is one.

References