cp's OEIS Frontend

All the U(i;n,k) mimic the ordinary multiplication table in that they are commutative, associative, have identity element 1 and have 0. However (except when i=2) they are partially distributive, meaning that distributivity works except if an even number is partitioned into a sum of two odd numbers. Only when i=2, the odd-even-dependent A319929 term disappears and normal distributivity holds.

U(0;n,k) = A319929(n,k);

U(1;n,k) = A322630(n,k);

U(2;n,k) = n*k;

U(3;n,k) = A322744(n,k);

U(4;n,k) = A327259(n,k);

U(i;n,k) = 2i*floor(n/2)*floor(k/2) + A319929(n,k).

Row 1 is 2p-1 where p is a prime number (A076274 without 1).

Row 2 is the prime numbers.

Row 3 is A307002.

Row 4 is A327261.

The i-th row of T(n,k) consists of numbers that sieve out of the array U(i;n,k) = (i*n*k - (i-2)*A319929(n,k))/2, in numerical order.

From David Lovler, Sep 02 2020: (Start)

Row 1 has no even numbers. Row 2 has one even number. Generally, the even numbers of the i-th row start with i-1 consecutive even numbers (from 2). This is because U(i;2,2) = 2*i gives the first even number not in row i.

Row 3 seems to have even numbers that, after 2, coincide with A112774 which has an infinite number of terms. For i > 3, as i increases, row i has a denser presence of even numbers, thus each row has an infinite number of even terms.

Generalization of the twin prime conjecture: Since row 2 is the prime numbers, we can observe the twin prime conjecture that after the first three odd primes, the sprinkling of pairs of consecutive prime numbers never ends. Concerning just odd terms, a similar conjecture can be stated for rows i >= 3. Row 3 starts with four odd numbers then the sprinkling of three consecutive odd number never ends. Row 4 starts with five odd numbers then the sprinkling of four consecutive odd numbers never ends. The pattern continues as row i starts with i+1 odd numbers then the sprinkling of i consecutive odd numbers never ends. We can take this back to row 1 which starts with two odd numbers then continues with isolated odd numbers.

Studying the even terms, there is an analog to the above generalization of the twin prime conjecture. Row 3 starts with two even numbers then continues with isolated even numbers. Row 4 starts with three even numbers then the sprinkling of pairs of consecutive even numbers never ends. Row 5 starts with four even numbers then the sprinkling of three consecutive even numbers never ends. The pattern continues as row i starts with i-1 even numbers then the sprinkling of i-2 consecutive even numbers never ends.

(End)

Terms > 5 have 7 for their units digit. This is because the units digit of A327261 terms can't be 0 or 3 (row 3 of A327259 has all numbers that end in 0 or 3) and there are at most 2 consecutive even terms (see comment for A327263).

All terms m == 1 (mod 3). To prove this, look at gaps of 3 in row 2 of array A322744(n,k). The longest strings of consecutive numbers not in A322744(n,k) can occur only for these 3 numbers. The number following such a gap is A322744(2,e) = (3*2*e)/2 = 3e for some even e. The middle of the string, m = A322744(2,e) - 2 = 3e - 2. Thus m == 1 (mod 3). After the first term, all terms m == 2 (mod 4).- David Lovler, Nov 29 2021

U(n,k) is a commutative and associative array with integer values that depend on whether n and k are odd or even.

U(n,k) = (5*n*k - 3*(n+k-1))/2 when n and k are both odd.

U(n,k) = (5*n*k - 3*n)/2 when n is even and k is odd.

U(n,k) = (5*n*k - 3*k)/2 when n is odd and k is even.

U(n,k) = 5*n*k/2 when n and k are both even.

U(n,1) = n for all n (identity element).

U(n,0) = 0 for all n.

The ordered list of numbers >5 that do not appear in array U(n,k) for n and k > 1 can have at most 3 consecutive even numbers and at most 5 consecutive odd numbers. See rows 2 and 3.

The terms all end in 6 because row 2 of U(n,k) has all numbers that end in 0 or 2 and there are at most 3 consecutive even numbers in the set of numbers not in array U(n,k) excluding the first row and column (see comment for A327263).

There are 119 terms up to 5*10^6.