cp's OEIS Frontend

A327263 Array T(n,k) in which the i-th row consists of numbers > 1 not in array U(i;n,k) = (i*n*k - (i-2)*A319929(n,k))/2 where i >= 1, n >= 1 and k >= 1, read by antidiagonals.

%I A327263 #80 Jul 09 2022 11:11:04
%S A327263 3,5,2,9,3,2,13,5,3,2,21,7,4,3,2,25,11,5,4,3,2,33,13,7,5,4,3,2,37,17,
%T A327263 9,6,5,4,3,2,45,19,10,7,6,5,4,3,2,57,23,13,9,7,6,5,4,3,2,61,29,15,11,
%U A327263 8,7,6,5,4,3,2,73,31,17,12,9,8,7,6,5,4,3,2
%N A327263 Array T(n,k) in which the i-th row consists of numbers > 1 not in array U(i;n,k) = (i*n*k - (i-2)*A319929(n,k))/2 where i >= 1, n >= 1 and k >= 1, read by antidiagonals.
%C A327263 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.
%C A327263 U(0;n,k) = A319929(n,k);
%C A327263 U(1;n,k) = A322630(n,k);
%C A327263 U(2;n,k) = n*k;
%C A327263 U(3;n,k) = A322744(n,k);
%C A327263 U(4;n,k) = A327259(n,k);
%C A327263 U(i;n,k) = 2i*floor(n/2)*floor(k/2) + A319929(n,k).
%C A327263 Row 1 is 2p-1 where p is a prime number (A076274 without 1).
%C A327263 Row 2 is the prime numbers.
%C A327263 Row 3 is A307002.
%C A327263 Row 4 is A327261.
%C A327263 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.
%C A327263 From _David Lovler_, Sep 02 2020: (Start)
%C A327263 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.
%C A327263 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.
%C A327263 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.
%C A327263 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.
%C A327263 (End)
%F A327263 With one exception there are likely no formulas for the rows of T(n,k) since their creation is based on a sieving process like the familiar prime number sieve. The exception is T(1,k) = 2*T(2,k)-1.
%e A327263 3  5  9  13  21  25  33  37  45  57  61  73  81  85  93 105 117 121 133 141 145 ...
%e A327263 2  3  5   7  11  13  17  19  23  29  31  37  41  43  47  53  59  61  67  71  73 ...
%e A327263 2  3  4   5   7   9  10  13  15  17  21  22  23  25  29  31  34  37  39  41  45 ...
%e A327263 2  3  4   5   6   7   9  11  12  14  15  17  19  21  22  25  27  28  29  31  35 ...
%e A327263 2  3  4   5   6   7   8   9  11  13  14  16  17  18  19  21  23  25  26  28  29 ...
%e A327263 2  3  4   5   6   7   8   9  10  11  13  15  16  18  19  20  21  22  23  25  27 ...
%e A327263 2  3  4   5   6   7   8   9  10  11  12  13  15  17  18  20  21  22  23  24  25 ...
%e A327263 2  3  4   5   6   7   8   9  10  11  12  13  14  15  17  19  20  22  23  24  25 ...
%e A327263 2  3  4   5   6   7   8   9  10  11  12  13  14  15  16  17  19  21  22  24  25 ...
%e A327263 2  3  4   5   6   7   8   9  10  11  12  13  14  15  16  17  18  19  21  23  24 ...
%e A327263 ...
%t A327263 row=12;max=200;U[i_,n_,k_]:=(i*n*k-(i-2)If[OddQ@n,If[OddQ@k,n+k-1,k],If[OddQ@k,n,0]])/2;t=Table[c=Union@Flatten@Table[U[i,n,k],{n,2,max},{k,2,max}];Complement[Range[2,max],c][[;;row]],{i,row}];Flatten@Table[t[[m,k-m+1]],{k,row},{m,k}] (* _Giorgos Kalogeropoulos_, Jun 08 2021 *)
%Y A327263 Cf. A000040, A003991, A076274, A112774.
%Y A327263 Cf. A319929, A322630, A322744, A327259, A345474.
%Y A327263 Cf. A354596.
%K A327263 nonn,tabl
%O A327263 1,1
%A A327263 _David Lovler_, Oct 15 2019