cp's OEIS Frontend

a(n) is also the binary weight of the largest multiplicity in the multiset of prime factors of n.

Any finite multiset m has a unique binary representation as a finite word bin(m) = s_k..s_1 such that: (1) each "digit" s_i is a finite set, (2) the leading term s_k is nonempty, and (3) m = 1*s_1 + 2*s_2 + 4*s_3 + 8*s_4 + ... + 2^(k-1)*s_k where + is multiset union, 1*S = S as a multiset, and n*S = 1*S + (n-1)*S for n > 1. The word bin(m) can be thought of as a finite 2-adic set. For example,

bin({1,1,1,1,2,2,3,3,3}) = {1}{2,3}{3},

bin({1,1,1,1,1,2,2,2,2}) = {1,2}{}{1},

bin({1,1,1,1,1,2,2,2,3}) = {1}{2}{1,2,3}.

a(n) is the least k such that columns indexed k or greater in A329050 contain no divisors of n. - Peter Munn, Feb 10 2020

x^(2^n) - a(n) is the minimal polynomial over Q for the algebraic number sqrt(p(1)*sqrt(p(2)*...*sqrt(p(n-1)*sqrt(p(n)))...)), where p(k) is the k-th prime. Each such monic polynomial is irreducible by Eisenstein's Criterion (using p = p(n)).

A prime version of Somos's quadratic recurrence sequence A052129(n) = A052129(n-1)^2 * n = Product_{k=1..n} k^(2^(n-k)). - Jonathan Sondow, Mar 29 2014

All positive integers have unique factorizations into powers of distinct primes, and into powers of squarefree numbers with distinct exponents that are powers of 2. (See A329332 for a description of the relationship between the two.) a(n) is the least number such that both factorizations have n factors. - Peter Munn, Dec 15 2019

From Peter Munn, Jan 24 2020 to Feb 06 2020: (Start)

For n >= 0, a(n+1) is the n-th power of 12 in the monoid defined by A306697.

a(n) is the least positive integer that cannot be expressed as the product of fewer than n terms of A072774 (powers of squarefree numbers).

All terms that are less than the order of the Monster simple group (A003131) are divisors of the group's order, with a(6) exceeding its square root.

(End)

It is remarkable that 4 of the first 5 terms are factorials. - Hal M. Switkay, Jan 21 2025

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

Every number in this sequence is the product of a unique subset of A225548.

From Peter Munn, Feb 11 2020: (Start)

The terms are the numbers whose Fermi-Dirac factors (see A050376) occur symmetrically about the main diagonal of A329050.

Closed under the commutative binary operation A059897(.,.). As numbers are self-inverse under A059897, the sequence thereby forms a subgroup of the positive integers under A059897.

(End)

The appearance of a number is determined by its prime signature.

Every squarefree number is present, as the square root of the square part of a squarefree number is 1. Other 4th-power-free numbers are present if and only if they are nonsquare.

If the square part of nonsquarefree k is a 4th power, k does not appear.

Every positive integer k is the product of a unique subset S_k of the terms of A050376, which are arranged in array form in A329050 (primes in column 0, squares of primes in column 1, 4th powers of primes in column 2 and so on). k > 1 is in this sequence if and only if the members of S_k occur in consecutive columns of A329050, starting with column 0.

If the qualifying condition in the previous paragraph was based on the rows instead of the columns of A329050, we would get A055932. The self-inverse function defined by A225546 transposes A329050. A225546 also has multiplicative properties such that if we consider A055932 and this sequence as sets, A225546(.) maps the members of either set 1:1 onto the other set.

The appearance of a number is determined by its prime signature.

No terms are squarefree, as the square root of the square part of a squarefree number is 1.

If the square part of k is a 4th power, other than 1, k appears.

Every positive integer k is the product of a unique subset S_k of the terms of A050376, which are arranged in array form in A329050 (primes in column 0, squares of primes in column 1, 4th powers of primes in column 2 and so on). k is in this sequence if and only if there is m >= 1 such that column m of A329050 contains a member of S_k, but column m - 1 does not.

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

For any n > 0:

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

- let G(n) be the undirected graph with vertices F(n) and the following connection rules: for any k >= 0 and any pair of consecutive prime numbers (p, q):

- p^(2^k) and p^(2^(k+1)) are connected,

- p^(2^k) and q^(2^k) are connected,

- a(n) is the number of connected components in G(n).

The sequence may be specified algebraically by formulas (1) to (2c) in my contemporary entry in the formula section. - Peter Munn, Jan 05 2021