bibkey: oeis2026a115801
authors: OEIS Foundation
year: 2026
title: "OEIS A115801: ordinary and binary carryless multiplier conditions"
doi: null
url: https://oeis.org/A115801
claim: "A115801 defines the nonnegative integers k satisfying 9*k = A048720(25,k) and conjectures that the same numbers satisfy 15*k = A048720(19,k). A048720 is binary polynomial multiplication over GF(2)."
strata_touched:
  - D5/S1/Digit/Admissibility/CarrylessMultiplierEquivalence
license: citation-only
triage: anchor

Binary carryless multiplier conditions

The name of A115801 gives the condition 9*k = A048720(25,k). Its conjectural second condition is 15*k = A048720(19,k). The quantifier is over all nonnegative integers, including zero. A048720 denotes the two-argument binary polynomial multiplication table, with binary digits interpreted as coefficients over GF(2). The other two multiplications are ordinary natural-number multiplication.

Verified locator

• https://oeis.org/A115801 (https://oeis.org/A115801/internal): NAME gives the first multiplier condition; COMMENTS states the conjectured second condition and the finite check, revision 20.
• https://oeis.org/A048720/internal : NAME defines the two-argument binary polynomial multiplication table over GF(2); FORMULA gives its binary exclusive-OR recursion; COMMENTS, revision 62.

The reported finite check in A115801 is distinct from the universal assertion.