cp's OEIS Frontend

A permutation of the odd numbers.

Every positive integer, m, is the product of a unique subset of the terms of A050376. The members of the subset are often known as the Fermi-Dirac factors of m. In this sequence, the odd numbers appear lexicographically according to their Fermi-Dirac factors (with those factors listed in decreasing order). The equivalent sequence for all positive integers is A052330.

The sequence has a conditional exponential identity shown in the formula section. This relies on the offset being 0, as in related sequences, notably A019565 and A052330.

The ones in the binary expansion of n encode the Fermi-Dirac factors of a(n).

The following table gives the rank of the bit corresponding to the Fermi-Dirac factor p^2^k:

...

7| 9

5| 5 8

3| 2 4 7

2| 0 1 3 6

---+--------

p/k| 0 1 2 3 ...

This sequence is a bijection from the nonnegative integers to the positive integers with inverse A344536.

This sequence establishes a bijection from A261195 to A225547.

This sequence and A344535 each map between two useful choices for encoding sets of elements drawn from a 2-dimensional array. To give a very specific example, each mapping is an isomorphism between two alternative integer representations of the polynomial ring GF2[x,y]. The relevant set is {x^i*y^j : i, j >= 0}. The mappings between the two representations of the ring's addition operation are from XOR (A003987) to A059897(.,.) and for the multiplication operation, they are from A329331(.,.) to A329329(.,.). - Peter Munn, May 31 2021

The ones in the binary expansion of n encode the Fermi-Dirac factors of a(n).

The following table gives the rank of the bit corresponding to the Fermi-Dirac factor p^2^k:

...

7| 6

5| 3 7

3| 1 4 8

2| 0 2 5 9

---+--------

p/k| 0 1 2 3 ...

This sequence is a bijection from the nonnegative integers to the positive integers with inverse A344537.

This sequence establishes a bijection from A261195 to A225547.

For all i, j:

A319704(i) = A319704(j) => a(i) = a(j) => A323082(i) = A323082(j).

Reminiscent of the Doudna sequence A005940; also of A052330 and A269848.

All powers of 2 (a(n) = n) are assigned first in order to avoid the second part of the definition giving a(n) = 2^k for some n which is not a power of 2 (see Example for a(12) = 20).

It follows from the definition that all powers of 2, all primes and all multiples of all primes are terms so this sequence is a permutation of the positive integers (A000027), with primes in order.

Each prime power appears before any of its multiples, meaning that this sequence has "property S" as defined in A368900.

Each term in the series is computed by translating the previous term to binary, then reinterpreting the binary expression as a product of metaprimes. Metaprimes follow the form p^(2^n) where p is a prime number and n is a nonnegative integer. See the link for more detailed explanation.

When creating A329329, the author realized it was isomorphic to multiplication in the GF(2)[x,y] polynomial ring. However, A329329 was unusual in having A059897(.,.) as additive operator, whereas the equivalent univariate polynomial ring, GF(2)[x], is more commonly mapped (to integers) with bitwise exclusive-or (A003987) representing polynomial addition (and A048720(.,.) representing polynomial multiplication). This sequence shows how multiplication in GF(2)[x] can look when mapped to integers with A059897(.,.) representing polynomial addition.

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 the polynomial ring GF(2)[x]. 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. The most meaningful generating set for the additive group of GF(2)[x] is {x^i: i >= 0}.

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

Note that A050376 is closed with respect to A(.,.).

Recall that GF(2)[x] is more usually mapped to integers with A003987(.,.) as addition and A048720(.,.) as multiplication. With this usual mapping, under which A000079(i) is the image of x^i, A052330(.) is the relevant isomorphism from nonnegative integers under A048720(.,.) and A003987(.,.) to positive integers under A(.,.) and A059897(.,.), with A052331(.) its inverse.

Sequence A052331 claims to be the "inverse" of A052330.