cp's OEIS Frontend

This sequence is a permutation of A050376, so every positive integer is the product of a unique subset, S_factors, of its terms. If we restrict S_factors to be chosen from a subset, S_0, consisting of numbers from specified rows and/or columns of this array, there are notable sequences among those that may be generated. See the examples. Other notable sequences can be generated if we restrict the intersection of S_factors with specific rows/columns to have even cardinality. In any of the foregoing cases, the numbers in the resulting sequence form a group under the binary operation A059897(.,.).

Shares with array A246278 the property that columns grow downward by iterating A003961, and indeed, this array can be obtained from A246278 by selecting its columns 1, 2, 8, 128, ..., 2^((2^k)-1), for k >= 0.

A(n,k) is the image of the lattice point with coordinates X=n and Y=k under the inverse of the bijection f defined in the first comment of A306697. This geometric relationship can be used to construct an isomorphism from the polynomial ring GF(2)[x,y] to a ring over the positive integers, using methods similar to those for constructing A297845 and A306697. See A329329, the ring's multiplicative operator, for details.

Each row i is a multiplicative function, being in essence "the i-th power" of A003961, i.e., A(i,j) = A003961^i (j). Zeroth power gives an identity function, A001477, which occurs as the row zero.

The terms in the same column have the same prime signature.

The array is read by antidiagonals: A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ... .

Square array A(n,k), n >= 1, k >= 1, read by descending antidiagonals.

The group defined by the binary operation A059897(.,.) over the positive integers is commutative with all elements self-inverse, and isomorphic to the additive group of GF(2) polynomial rings such as GF(2)[x,y]. There is a unique isomorphism extending each bijective mapping between respective minimal generating sets. The lexicographically earliest minimal generating set for the A059897 group is A050376, often called the Fermi-Dirac primes. This set has a natural arrangement in a square array, given by A329050(i,j) = prime(i+1)^(2^j), i >= 0, j >= 0. The most meaningful generating set for the additive group of GF(2)[x,y] is {x^i * y^j: i >= 0, j >= 0}, which similarly forms a square array. All this makes A329050(i,j) especially appropriate to be the image (under an isomorphism) of the GF(2) polynomial x^i * y^j.

Using g to denote the intended isomorphism, we specify g(x^i * y^j) = A329050(i,j). This maps minimal generating sets of the additive groups, so the definition of g is completed by specifying g(a+b) = A059897(g(a), g(b)). We then calculate the image under g of polynomial multiplication in GF(2)[x,y], giving us this sequence as the matching multiplicative operator for an isomorphic ring over the positive integers. Using f to denote the inverse of g, A[n,k] = g(f(n) * f(k)).

See the formula section for an alternative definition based on the A329050 array, independent of GF(2)[x,y].

Closely related to A306697 and A297845. If A059897 is replaced in the alternative definition by A059896 (and the definition is supplemented by the derived identity for the absorbing element, shown in the formula section), we get A306697; if A059897 is similarly replaced by A003991 (integer multiplication), we get A297845. This sequence and A306697, considered as multiplicative operators, are carryless arithmetic equivalents of A297845. A306697 uses a method analogous to binary-OR when there would be a multiplicative carry, while this sequence uses a method analogous to binary exclusive-OR. In consequence A(n,k) <> A297845(n,k) exactly when A306697(n,k) <> A297845(n,k). This relationship is not symmetric between the 3 sequences: there are n and k such that A(n,k) = A306697(n,k) <> A297845(n,k). For example A(54,72) = A306697(54,72) = 273375000 <> A297845(54,72) = 22143375000.

n-th power of x+1 using the encoding of polynomials defined in A206284 and A297845. - Peter Munn, Jul 20 2022

From Antti Karttunen, Jul 29 2015: (Start)

The square array A(row,col) is read by downwards antidiagonals as: A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.

A(n,m) (entry at row=n, column=m) gives the evaluation at x=n of the polynomial (with nonnegative integer coefficients) bijectively encoded in the prime factorization of m. See A206284, A206296 for the details of that encoding. (The roles of variables n and m were accidentally swapped in this description, corrected by Antti Karttunen, Oct 30 2016)

(End)

Each row is a completely additive sequence, row n mapping prime(m) to n^(m-1). - Peter Munn, Apr 22 2022

A multiplicative semigroup: if m and n are in the sequence, then so is m*n. - Antti Karttunen, Jul 02 2024

For any m > 0:

- let F(m) be the set of distinct Fermi-Dirac primes (A050376) with product m,

- for any i >=0 0 and j >= 0, let f(prime(i+1)^(2^i)) be the lattice point with coordinates X=i and Y=j (where prime(k) denotes the k-th prime number),

- f establishes a bijection from the Fermi-Dirac primes to the lattice points with nonnegative coordinates,

- let P(m) = { f(p) | p in F(m) },

- P establishes a bijection from the nonnegative integers to the set, say L, of finite sets of lattice points with nonnegative coordinates,

- let Q be the inverse of P,

- for any n > 0 and k > 0:

T(n, k) = Q(P(n) + P(k))

where "+" denotes the Minkowski addition on L.

This sequence has similarities with A297845, and their data sections almost match; T(6, 6) = 30, however A297845(6, 6) = 90.

This sequence has similarities with A067138; here we work on dimension 2, there in dimension 1.

This sequence as a binary operation distributes over A059896, whereas A297845 distributes over multiplication (A003991) and A329329 distributes over A059897. See the comment in A329329 for further description of the relationship between these sequences. - Peter Munn, Dec 19 2019

As a square array read by descending antidiagonals, A(n, k), n >= 1, k >= 1, gives the encoding defined in A297845 of the polynomial (x+1)^(n-1) * x^(k-1). - Peter Munn, Jul 27 2022

Seen as a triangle read by rows: T(n,k) = A000040(n), 1 <= k <= n; row sums = A033286; central terms = A031368. - Reinhard Zumkeller, Aug 05 2009

Seen as a square array read by antidiagonals, a subtable of the binary operation multiplication tables A297845, A306697 and A329329. - Peter Munn, Jan 15 2020

Previous name: There exists an isomorphism from the positive rationals under multiplication to Z[x] under addition, defined by f(q) = e1 + (e2)x + (e3)(x^2) +...+ (ek)(x^(k-1)) + ... (where e_i is the exponent of the i-th prime in q's prime factorization) The a(n) above are calculated by a(n) = f^(-1)[d/dx f(n)] (In other words: differentiate n's image in Z[x] and return to Q).

With primes noted p_0 = 2, p_1 = 3, etc., let f be the function that maps n = Product_{i=0..d} p_i^e_i to P = Sum_{i=0..d} e_i*X^i; and let g be the inverse function of f. a(n) is by definition g(P') = g((f(n))'). - Luc Rousseau, Aug 06 2018