OFFSET
1,2
COMMENTS
This is GF(2)[X] analog of A126988, using "carryless division in base-2" instead of ordinary division.
The triangular table T(n,k), n=1.., k=1..n is read by rows: T(1,1), T(2,1), T(2,2), T(3,1), T(3,2), T(3,3), etc.
LINKS
FORMULA
T(n,k) = the unique d such that A048720(d,k) = n, provided that such d exists, otherwise zero.
EXAMPLE
The first 17 rows of the triangle:
1
2 1
3 0 1
4 2 0 1
5 0 3 0 1
6 3 2 0 0 1
7 0 0 0 0 0 1
8 4 0 2 0 0 0 1
9 0 7 0 0 0 3 0 1
10 5 6 0 2 3 0 0 0 1
11 0 0 0 0 0 0 0 0 0 1
12 6 4 3 0 2 0 0 0 0 0 1
13 0 0 0 0 0 0 0 0 0 0 0 1
14 7 0 0 0 0 2 0 0 0 0 0 0 1
15 0 5 0 3 0 0 0 0 0 0 0 0 0 1
16 8 0 4 0 0 0 2 0 0 0 0 0 0 0 1
17 0 15 0 5 0 0 0 0 0 0 0 0 0 3 0 1
-----------------------------------
7 ("111" in binary) encodes polynomial X^2 + X + 1, which is irreducible over GF(2) (7 is in A014580), so it is divisible only by itself and 1, and thus T(7,1) = 7, T(7,k) = 0 for k=2..6 and T(7,7) = 1.
9 ("1001" in binary) encodes polynomial X^3 + 1, which is factored over GF(2) as (X+1)(X^2 + X + 1), and thus T(9,3) = 7 and T(9,7) = 3 because the polynomial X + 1 is encoded by 3 ("11" in binary).
PROG
CROSSREFS
AUTHOR
Antti Karttunen, Jan 09 2017
STATUS
approved