cp's OEIS Frontend

The function A181819 maps n = p^i*...*q^j to prime(i)*...*prime(j) = product of primes indexed by the prime exponents of n.

We define the omega-sequence of n (row n of A323023) to have length A323014(n) = adjusted frequency depth of n, and the k-th term is Omega(red^{k-1}(n)), where Omega = A001222 and red^{k} is the k-th functional iteration of red = A181819, defined by red(n = p^i*...*q^j) = prime(i)*...*prime(j) = product of primes indexed by the prime exponents of n. For example, we have 180 -> 18 -> 6 -> 4 -> 3, so the omega-sequence of 180 is (5,3,2,2,1).

Warning: If the prime multiplicities of n are a multiset y, this sequence gives the product of multiplicities in y, not the product of y.

Differs from A351946 at A351946(1260) = 4, a(1260) = 2.

Differs from A327500 at A327500(450) = 3, a(450) = 2.

We set a(1) = 0 so that the positions of first appearances are the primorials A002110.

Also the product of the prime metasignature of n (row n of A238747).

The adjusted frequency depth of a positive integer n is 0 if n = 1, and otherwise it is 1 plus the number of times one must apply A181819 to reach a prime number, where A181819(k = p^i*...*q^j) = prime(i)*...*prime(j) = product of primes indexed by the prime exponents of k. For example, 180 has adjusted frequency depth 5 because we have: 180 -> 18 -> 6 -> 4 -> 3.

Differs from A182857 in having 2 instead of 3.

In each case, 2 is the fixed point that is reached (1 is the other fixed point of the x -> A181819(x) map).

Includes all integers whose prime signature a) contains two or more distinct numbers, and b) contains no number that occurs the same number of times as any other number. The first member of this sequence that does not fit that description is 75675600, whose prime signature is (4,3,2,2,1,1).

A full characterization is: Numbers whose prime signature (1) has not all equal multiplicities but (2) the numbers of distinct parts appearing with each distinct multiplicity are all equal. For example, the prime signature of 2520 is {1,1,2,3}, which satisfies (1) but fails (2), as the numbers of distinct parts appearing with each distinct multiplicity are 1 (with multiplicity 2, the part being 1) and 2 (with multiplicity 1, the parts being 2 and 3). Hence the sequence does not contain 2520. - Gus Wiseman, Jan 02 2019

Positions of 3's in A071625.

Numbers k such that A001221(A181819(k)) = 3.

The asymptotic density of this sequence is (6/Pi^2) * Sum_{n>=2, n squarefree} r(n)/((n-1)*psi(n)) = 0.030575..., where psi is the Dedekind psi function (A001615), and r(n) = Sum_{d|n, 1Amiram Eldar, Oct 18 2020

Positions of 4's in A071625.

Numbers k such that A001221(A181819(k)) = 4.

Is a(n) ~ c * n for some c? - David A. Corneth, Jan 09 2019

The asymptotic density of this sequence is (6/Pi^2) * Sum_{n>=2, n squarefree} r(n)/((n-1)*psi(n)) = 0.00035750... (corresponding to c = 2797.1... in the question above, whose answer is affirmative), where psi is the Dedekind psi function (A001615), and r(n) = Sum_{d_1|n, 1Amiram Eldar, Oct 18 2020

The first term is A006939(2) = 12.

First differs from A059404 in lacking 360, whose prime signature has three distinct parts.

Positions of 2's in A071625.

Numbers k such that A001221(A181819(k)) = 2.

The asymptotic density of this sequence is (6/Pi^2) * Sum_{n>=2, n squarefree} 1/((n-1)*psi(n)) = 0.3611398..., where psi is the Dedekind psi function (A001615) (Sanna, 2020). - Amiram Eldar, Oct 18 2020

The omega-sequence of an integer partition is the sequence of lengths of the multisets obtained by repeatedly taking the multiset of multiplicities until a singleton is reached. For example, the partition (32211) has chain of multisets of multiplicities {1,1,2,2,3} -> {1,2,2} -> {1,2} -> {1,1} -> {2}, so its omega-sequence is (5,3,2,2,1).

The Heinz numbers of these partitions are given by A325247.

We define the omega-sequence of n (row n of A323023) to have length A323014(n) = adjusted frequency depth of n, and the k-th term is Omega(red^{k-1}(n)), where Omega = A001222 and red^{k} is the k-th functional iteration of red = A181819, defined by red(n = p^i*...*q^j) = prime(i)*...*prime(j) = product of primes indexed by the prime exponents of n. For example, we have 180 -> 18 -> 6 -> 4 -> 3, so the omega-sequence of 180 is (5,3,2,2,1).

The enumeration of these partitions by sum is given by A325260.