A323023 -id:A323023 - cp's OEIS frontend

A353840 Trajectory of the partition run-sum transformation of n, using Heinz numbers.

1, 2, 3, 4, 3, 5, 6, 7, 8, 5, 9, 7, 10, 11, 12, 9, 7, 13, 14, 15, 16, 7, 17, 18, 14, 19, 20, 15, 21, 22, 23, 24, 15, 25, 13, 26, 27, 13, 28, 21, 29, 30, 31, 32, 11, 33, 34, 35, 36, 21, 37, 38, 39, 40, 25, 13, 41, 42, 43, 44, 33, 45, 35, 46, 47, 48, 21, 49, 19

Offset: 1

Gus Wiseman, May 25 2022

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.
The run-sum trajectory is obtained by repeatedly taking the run-sum transformation (A353832) until a squarefree number is reached. For example, the trajectory 12 -> 9 -> 7 given in row 12 corresponds to the partitions (2,1,1) -> (2,2) -> (4).
This is the iteration of the transformation f described by Kimberling at A237685.

			Triangle begins:
   1
   2
   3
   4  3
   5
   6
   7
   8  5
   9  7
  10
  11
  12  9  7
Row 87780 is the following trajectory (left column), with prime indices shown on the right:
  87780: {1,1,2,3,4,5,8}
  65835: {2,2,3,4,5,8}
  51205: {3,4,4,5,8}
  19855: {3,5,8,8}
   2915: {3,5,16}

The version for run-lengths instead of sums is A325239 or A325277.
This is the iteration of A353832, with composition version A353847.
Row-lengths are A353841, counted by A353846.
Final terms are A353842.
Counting rows by final omega gives A353843.
Rows ending in a prime number are A353844, counted by A353845.
These sequences for compositions are A353853-A353859.
A001222 counts prime factors, distinct A001221.
A056239 adds up prime indices, row sums of A112798 and A296150.
A124010 gives prime signature, sorted A118914.
A182850 or A323014 gives frequency depth.
A300273 ranks collapsible partitions, counted by A275870.
A353833 ranks partitions with all equal run-sums, counted by A304442.
A353835 counts distinct run-sums of prime indices, weak A353861.
A353838 ranks partitions with all distinct run-sums, counted by A353837.
A353862 gives greatest run-sum of prime indices, least A353931.
Cf. A071625, A073093, A181819, A323023, A353743, A353834, A353864, A353865, A353866, A353867.

Table[NestWhileList[Times@@Prime/@Cases[FactorInteger[#],{p_,k_}:>PrimePi[p]*k]&,n,Not@*SquareFreeQ],{n,30}]

A325268 Triangle read by rows where T(n,k) is the number of integer partitions of n with omicron k.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 3, 0, 1, 0, 1, 5, 0, 0, 1, 0, 1, 7, 2, 0, 0, 1, 0, 1, 12, 1, 0, 0, 0, 1, 0, 1, 17, 2, 1, 0, 0, 0, 1, 0, 1, 24, 4, 0, 0, 0, 0, 0, 1, 0, 1, 33, 5, 1, 1, 0, 0, 0, 0, 1, 0, 1, 44, 9, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 57, 14, 3, 0, 1

Offset: 0

Gus Wiseman, Apr 18 2019

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. The omicron of the partition is 0 if the omega-sequence is empty, 1 if it is a singleton, and otherwise the second-to-last part. 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), and its omicron is 2.

			Triangle begins:
  1
  0  1
  0  1  1
  0  1  1  1
  0  1  3  0  1
  0  1  5  0  0  1
  0  1  7  2  0  0  1
  0  1 12  1  0  0  0  1
  0  1 17  2  1  0  0  0  1
  0  1 24  4  0  0  0  0  0  1
  0  1 33  5  1  1  0  0  0  0  1
  0  1 44  9  1  0  0  0  0  0  0  1
  0  1 57 14  3  0  1  0  0  0  0  0  1
  0  1 76 20  3  0  0  0  0  0  0  0  0  1
Row n = 8 counts the following partitions.
  (8)  (44)       (431)  (2222)  (11111111)
       (53)       (521)
       (62)
       (71)
       (332)
       (422)
       (611)
       (3221)
       (3311)
       (4211)
       (5111)
       (22211)
       (32111)
       (41111)
       (221111)
       (311111)
       (2111111)

Andrew Howroyd, Table of n, a(n) for n = 0..1325 (rows 0..50)

Row sums are A000041. Column k = 2 is A325267.
Cf. A181819, A181821, A304634, A304636, A323014, A323023, A325250, A325273, A325277.
Omega-sequence statistics: A001222 (first omega), A001221 (second omega), A071625 (third omega), A323022 (fourth omega), A304465 (second-to-last omega), A182850 or A323014 (length/frequency depth), A325248 (Heinz number), A325249 (sum).
Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (length/frequency depth).

Table[Length[Select[IntegerPartitions[n],Switch[#,{},0,{},1,,NestWhile[Sort[Length/@Split[#]]&,#,Length[#]>1&]//First]==k&]],{n,0,10},{k,0,n}]

omicron(p)={if(!#p, 0, my(r=1); while(#p > 1, my(L=List(), k=0); r=#p; for(i=1, #p, if(i==#p||p[i]<>p[i+1], listput(L,i-k); k=i)); listsort(L); p=L); r)}
row(n)={my(v=vector(1+n)); forpart(p=n, v[1 + omicron(Vec(p))]++); v}
{ for(n=0, 10, print(row(n))) } \\ Andrew Howroyd, Jan 18 2023

A325249 Sum of the omega-sequence of n.

Original entry on oeis.org

0, 1, 1, 3, 1, 5, 1, 4, 3, 5, 1, 8, 1, 5, 5, 5, 1, 8, 1, 8, 5, 5, 1, 9, 3, 5, 4, 8, 1, 7, 1, 6, 5, 5, 5, 7, 1, 5, 5, 9, 1, 7, 1, 8, 8, 5, 1, 10, 3, 8, 5, 8, 1, 9, 5, 9, 5, 5, 1, 12, 1, 5, 8, 7, 5, 7, 1, 8, 5, 7, 1, 10, 1, 5, 8, 8, 5, 7, 1, 10, 5, 5, 1, 12, 5

Offset: 1

Gus Wiseman, Apr 16 2019

nonn

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 omega-sequence of 180 is (5,3,2,2,1) with sum 13, so a(180) = 13.

Positions of m's are A000040 (m = 1), A001248 (m = 3), A030078 (m = 4), A068993 (m = 5), A050997 (m = 6), A325264 (m = 7).
Cf. A056239, A118914, A181819, A182850, A323023, A325274.
Omega-sequence statistics: A001222 (first omega), A001221 (second omega), A071625 (third omega), A323022 (fourth omega), A304465 (second-to-last omega), A182850 or A323014 (length/frequency depth), A325248 (Heinz number).

omseq[n_Integer]:=If[n<=1,{},Total/@NestWhileList[Sort[Length/@Split[#]]&,Sort[Last/@FactorInteger[n]],Total[#]>1&]];
Table[Total[omseq[n]],{n,100}]

a(n) = A056239(A325248(n)).

a(n!) = A325274(n).

A225486 Maximal frequency depth for the partitions of n.

Original entry on oeis.org

0, 2, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7

Offset: 1

Clark Kimberling, May 08 2013

nonn

See A225485 for the definition of frequency depth.

The frequency depth of an integer partition is the number of times one must take the multiset of multiplicities to reach (1). For example, the partition (32211) has frequency depth 5 because we have: (32211) -> (221) -> (21) -> (11) -> (2) -> (1). Differs from A325282 at a(0) and a(1). - Gus Wiseman, Apr 19 2019

			(See A225485.)

Run lengths are A325258, i.e., first differences of Levine's sequence A011784.

Cf. A008284, A116608, A181819, A182850, A182857, A225485, A323014, A323023, A325239, A325242, A325254, A325282, A325283.

c[s_] := c[s] = Select[Table[Count[s, i], {i, 1, Max[s]}], # > 0 &]
f[s_] := f[s] = Drop[FixedPointList[c, s], -2]
t[s_] := t[s] = Length[f[s]]
u[n_] := u[n] = Table[t[Part[IntegerPartitions[n], k]],
    {k, 1, Length[IntegerPartitions[n]]}];
Prepend[Table[Max[u[n]], {n, 2, 10}], 0]
(* second program *)
grw[q_]:=Join@@Table[ConstantArray[i,q[[Length[q]-i+1]]],{i,Length[q]}];
Join@@MapIndexed[ConstantArray[#2[[1]]-1,#1]&,Length[#]-Last[#]&/@NestList[grw,{1,1},6]] (* Gus Wiseman, Apr 19 2019 *)

a(n) = number of terms in row n of the array in A225485, for n > 0.

More terms from Gus Wiseman, Apr 19 2019

A325248 Heinz number of the omega-sequence of n.

Original entry on oeis.org

1, 2, 2, 6, 2, 18, 2, 10, 6, 18, 2, 90, 2, 18, 18, 14, 2, 90, 2, 90, 18, 18, 2, 126, 6, 18, 10, 90, 2, 50, 2, 22, 18, 18, 18, 42, 2, 18, 18, 126, 2, 50, 2, 90, 90, 18, 2, 198, 6, 90, 18, 90, 2, 126, 18, 126, 18, 18, 2, 630, 2, 18, 90, 26, 18, 50, 2, 90, 18, 50

Offset: 1

Gus Wiseman, Apr 16 2019

nonn

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 Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The omega-sequence of 180 is (5,3,2,2,1) with Heinz number 990, so a(180) = 990.

Positions of squarefree terms are A325247.
Positions of normal numbers (A055932) are A325251.
First positions of each distinct term are A325238.
Cf. A056239, A070175, A112798, A118914, A181819, A181821, A323023, A325249, A325275, A325277.
Omega-sequence statistics: A001222 (first omega), A001221 (second omega), A071625 (third omega), A323022 (fourth omega), A304465 (second-to-last omega), A182850 or A323014 (length/frequency depth), A325248 (Heinz number).

omseq[n_Integer]:=If[n<=1,{},Total/@NestWhileList[Sort[Length/@Split[#]]&,Sort[Last/@FactorInteger[n]],Total[#]>1&]];
Table[Times@@Prime/@omseq[n],{n,100}]

A001222(a(n)) = A323014(n).
A061395(a(n)) = A001222(n).
A304465(n) = A055396(a(n)/2).
A325249(n) = A056239(a(n)).
a(n!) = A325275(n).

A080257 Numbers having at least two distinct or a total of at least three prime factors.

Original entry on oeis.org

6, 8, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 26, 27, 28, 30, 32, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99, 100

Offset: 1

Reinhard Zumkeller, Feb 10 2003

Complement of A000430; A080256(a(n)) > 3.
A084114(a(n)) > 0, see also A084110.
Also numbers greater than the square of their smallest prime-factor: a(n)>A020639(a(n))^2=A088377(a(n));
a(n)>A000430(k) for n<=13, a(n) < A000430(k) for n>13.
Numbers with at least 4 divisors. - Franklin T. Adams-Watters, Jul 28 2006
Union of A024619 and A033942; A211110(a(n)) > 2. - Reinhard Zumkeller, Apr 02 2012
Also numbers > 1 that are neither prime nor a square of a prime. Also numbers whose omega-sequence (A323023) has sum > 3. Numbers with omega-sequence summing to m are: A000040 (m = 1), A001248 (m = 3), A030078 (m = 4), A068993 (m = 5), A050997 (m = 6), A325264 (m = 7). - Gus Wiseman, Jul 03 2019
Numbers n such that sigma_2(n)*tau(n) = A001157(n)*A000005(n) >= 4*n^2. Note that sigma_2(n)*tau(n) >= sigma(n)^2 = A072861 for all n. - Joshua Zelinsky, Jan 23 2025

			8=2*2*2 and 10=2*5 are terms; 4=2*2 is not a term.
From _Gus Wiseman_, Jul 03 2019: (Start)
The sequence of terms together with their prime indices begins:
   6: {1,2}
   8: {1,1,1}
  10: {1,3}
  12: {1,1,2}
  14: {1,4}
  15: {2,3}
  16: {1,1,1,1}
  18: {1,2,2}
  20: {1,1,3}
  21: {2,4}
  22: {1,5}
  24: {1,1,1,2}
  26: {1,6}
  27: {2,2,2}
  28: {1,1,4}
  30: {1,2,3}
  32: {1,1,1,1,1}
(End)

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A001248, A001221, A001222, A006881, A030078, A088381, A088383, A000005.

Cf. A060687, A118914, A323014, A323023, A325249.

a080257 n = a080257_list !! (n-1)
a080257_list = m a024619_list a033942_list where
   m xs'@(x:xs) ys'@(y:ys) | x < y  = x : m xs ys'
                           | x == y = x : m xs ys
                           | x > y  = y : m xs' ys
-- Reinhard Zumkeller, Apr 02 2012

Select[Range[100],PrimeNu[#]>1||PrimeOmega[#]>2&] (* Harvey P. Dale, Jul 23 2013 *)

PARI
```
is(n)=omega(n)>1 || isprimepower(n)>2
```

is(n)=my(k=isprimepower(n)); if(k, k>2, !isprime(n)) \\ Charles R Greathouse IV, Jan 23 2025

a(n) = n + O(n/log n). - Charles R Greathouse IV, Sep 14 2015

Definition clarified by Harvey P. Dale, Jul 23 2013

A113901 Product of omega(n) and bigomega(n) = A001221(n)*A001222(n), where omega(x): number of distinct prime divisors of x. bigomega(x): number of prime divisors of x, counted with multiplicity.

Original entry on oeis.org

0, 1, 1, 2, 1, 4, 1, 3, 2, 4, 1, 6, 1, 4, 4, 4, 1, 6, 1, 6, 4, 4, 1, 8, 2, 4, 3, 6, 1, 9, 1, 5, 4, 4, 4, 8, 1, 4, 4, 8, 1, 9, 1, 6, 6, 4, 1, 10, 2, 6, 4, 6, 1, 8, 4, 8, 4, 4, 1, 12, 1, 4, 6, 6, 4, 9, 1, 6, 4, 9, 1, 10, 1, 4, 6, 6, 4, 9, 1, 10, 4, 4, 1, 12, 4, 4, 4, 8, 1, 12, 4, 6, 4, 4, 4, 12, 1, 6, 6, 8, 1, 9

Offset: 1

Cino Hilliard, Jan 29 2006

Positions of first appearances are A328964. - Gus Wiseman, Nov 05 2019

G. C. Greubel, Table of n, a(n) for n = 1..1000

A307409(n) is (bigomega(n) - 1) * omega(n).
A328958(n) is sigma_0(n) - bigomega(n) * omega(n).
Cf. A000005, A001221, A001222, A060687, A066921, A066922, A068993, A070175, A071625, A124010, A303555, A320632, A323023, A328956, A328957, A328964, A328965.

Table[PrimeNu[n]*PrimeOmega[n], {n,1,50}] (* G. C. Greubel, Apr 23 2017 *)

PARI
```
a(n) = omega(n)*bigomega(n);
```

a(n) = 1 iff n is prime.
A068993(a(n)) = 4. - Reinhard Zumkeller, Mar 13 2011
a(n) = A066921(n)*A066922(n). - Amiram Eldar, May 07 2025

A325239 Irregular triangle read by rows where row 1 is {1} and row n > 1 is the sequence starting with n and repeatedly applying A181819 until 2 is reached.

Original entry on oeis.org

1, 2, 3, 2, 4, 3, 2, 5, 2, 6, 4, 3, 2, 7, 2, 8, 5, 2, 9, 3, 2, 10, 4, 3, 2, 11, 2, 12, 6, 4, 3, 2, 13, 2, 14, 4, 3, 2, 15, 4, 3, 2, 16, 7, 2, 17, 2, 18, 6, 4, 3, 2, 19, 2, 20, 6, 4, 3, 2, 21, 4, 3, 2, 22, 4, 3, 2, 23, 2, 24, 10, 4, 3, 2, 25, 3, 2, 26, 4, 3, 2

Offset: 1

Gus Wiseman, Apr 15 2019

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

			Triangle begins:
   1              26 4 3 2        51 4 3 2          76 6 4 3 2
   2              27 5 2          52 6 4 3 2        77 4 3 2
   3 2            28 6 4 3 2      53 2              78 8 5 2
   4 3 2          29 2            54 10 4 3 2       79 2
   5 2            30 8 5 2        55 4 3 2          80 14 4 3 2
   6 4 3 2        31 2            56 10 4 3 2       81 7 2
   7 2            32 11 2         57 4 3 2          82 4 3 2
   8 5 2          33 4 3 2        58 4 3 2          83 2
   9 3 2          34 4 3 2        59 2              84 12 6 4 3 2
  10 4 3 2        35 4 3 2        60 12 6 4 3 2     85 4 3 2
  11 2            36 9 3 2        61 2              86 4 3 2
  12 6 4 3 2      37 2            62 4 3 2          87 4 3 2
  13 2            38 4 3 2        63 6 4 3 2        88 10 4 3 2
  14 4 3 2        39 4 3 2        64 13 2           89 2
  15 4 3 2        40 10 4 3 2     65 4 3 2          90 12 6 4 3 2
  16 7 2          41 2            66 8 5 2          91 4 3 2
  17 2            42 8 5 2        67 2              92 6 4 3 2
  18 6 4 3 2      43 2            68 6 4 3 2        93 4 3 2
  19 2            44 6 4 3 2      69 4 3 2          94 4 3 2
  20 6 4 3 2      45 6 4 3 2      70 8 5 2          95 4 3 2
  21 4 3 2        46 4 3 2        71 2              96 22 4 3 2
  22 4 3 2        47 2            72 15 4 3 2       97 2
  23 2            48 14 4 3 2     73 2              98 6 4 3 2
  24 10 4 3 2     49 3 2          74 4 3 2          99 6 4 3 2
  25 3 2          50 6 4 3 2      75 6 4 3 2       100 9 3 2

Michael De Vlieger, Table of n, a(n) for n = 1..10581 (rows 1..2500, flattened)
Michael De Vlieger, For m in row n, plot black else plot white, n = 1..120, 4X magnification.
Michael De Vlieger, For m in row n, plot black else plot white, n = 1..2^12.

Row lengths are A182850(n) + 1.
Cf. A001221, A001222, A071625, A118914, A181819, A181821, A182857, A323014, A323022, A323023, A325238, A325277.
See A353510 for a full square array version of this table.

red[n_]:=Times@@Prime/@Last/@If[n==1,{},FactorInteger[n]];
Table[NestWhileList[red,n,#>2&],{n,30}]

A001222(T(n,k)) = A323023(n,k), n > 2, k <= A182850(n).

A307409 a(n) = (A001222(n) - 1)*A001221(n).

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 2, 1, 2, 0, 4, 0, 2, 2, 3, 0, 4, 0, 4, 2, 2, 0, 6, 1, 2, 2, 4, 0, 6, 0, 4, 2, 2, 2, 6, 0, 2, 2, 6, 0, 6, 0, 4, 4, 2, 0, 8, 1, 4, 2, 4, 0, 6, 2, 6, 2, 2, 0, 9, 0, 2, 4, 5, 2, 6, 0, 4, 2, 6, 0, 8, 0, 2, 4, 4, 2, 6, 0, 8, 3, 2, 0, 9, 2, 2, 2, 6, 0, 9, 2, 4, 2, 2, 2, 10, 0, 4, 4, 6, 0, 6, 0, 6

Offset: 1

Mats Granvik, Apr 07 2019

nonn

a(n) + 2 appears to differ from A000005 at n=1 and when n is a term of A320632. Verified up to n=3000.
If A320632 contains the numbers such that A001222(n) - A051903(n) > 1, then this sequence contains precisely the numbers p^k and p^k*q for distinct primes p and q. The comment follows, since d(p^k) = k+1 = (k-1)*1 + 2 and d(p^k*q) = 2k+2 = ((k+1)-1)*2 + 2. - Charlie Neder, May 14 2019
Positions of first appearances are A328965. - Gus Wiseman, Nov 05 2019
Regarding Neder's comment above, see also my comments in A322437. - Antti Karttunen, Feb 17 2021

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from exponents in factorization of n

Two less than A307408.
A113901(n) is bigomega(n) * omega(n).
A328958(n) is sigma_0(n) - bigomega(n) * omega(n).
Cf. A000005, A001221, A001222, A060687, A070175, A071625, A113901, A124010, A303555, A320632, A323023, A328956, A328957, A328964, A328965, A322437.

a[n_] := (PrimeOmega[n] - 1)*PrimeNu[n];
aa = Table[a[n], {n, 1, 104}];

a(n) = (bigomega(n) - 1)*omega(n); \\ Michel Marcus, May 15 2019

a(n) = (A001222(n) - 1)*A001221(n).
a(n) = binomial(A001222(n) - 1, 1)*binomial(A001221(n), 1).
a(n) = A307408(n) - 2.

A325276 Irregular triangle read by rows where row n is the omega-sequence of n!.

Original entry on oeis.org

1, 2, 2, 1, 4, 2, 2, 1, 5, 3, 2, 2, 1, 7, 3, 3, 1, 8, 4, 3, 2, 2, 1, 11, 4, 3, 2, 2, 1, 13, 4, 3, 2, 2, 1, 15, 4, 4, 1, 16, 5, 4, 2, 2, 1, 19, 5, 4, 2, 2, 1, 20, 6, 4, 2, 2, 1, 22, 6, 4, 2, 1, 24, 6, 5, 2, 2, 1, 28, 6, 5, 2, 2, 1, 29, 7, 5, 2, 2, 1

Offset: 0

Gus Wiseman, Apr 18 2019

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).

			Triangle begins:
  {}
  {}
   1
   2  2  1
   4  2  2  1
   5  3  2  2  1
   7  3  3  1
   8  4  3  2  2  1
  11  4  3  2  2  1
  13  4  3  2  2  1
  15  4  4  1
  16  5  4  2  2  1
  19  5  4  2  2  1
  20  6  4  2  2  1
  22  6  4  2  1
  24  6  5  2  2  1
  28  6  5  2  2  1
  29  7  5  2  2  1
  32  7  5  2  2  1
  33  8  5  2  2  1
  36  8  5  2  2  1
  38  8  5  2  2  1
  40  8  6  2  2  1
  41  9  6  2  2  1
  45  9  6  2  2  1
  47  9  6  2  2  1
  49  9  6  3  2  2  1
  52  9  6  3  2  2  1
  55  9  6  3  2  2  1
  56 10  6  3  2  2  1
  59 10  6  3  2  2  1

Row lengths are A325272. Row sums are A325274. Row n is row A325275(n) of A112798. Second-to-last column is A325273. Column k = 1 is A022559. Column k = 2 is A000720. Column k = 3 is A071626.
Cf. A000142, A006939, A081401, A303555, A323023, A325238, A325275, A325277.
Omega-sequence statistics: A001222 (first omega), A001221 (second omega), A071625 (third omega), A323022 (fourth omega), A304465 (second-to-last omega), A182850 or A323014 (length/frequency depth), A325248 (Heinz number), A325249 (sum).

omseq[n_Integer]:=If[n<=1,{},Total/@NestWhileList[Sort[Length/@Split[#]]&,Sort[Last/@FactorInteger[n]],Total[#]>1&]];
Table[omseq[n!],{n,0,30}]

cp's OEIS Frontend

A353840 Trajectory of the partition run-sum transformation of n, using Heinz numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325268 Triangle read by rows where T(n,k) is the number of integer partitions of n with omicron k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A325249 Sum of the omega-sequence of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A225486 Maximal frequency depth for the partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A325248 Heinz number of the omega-sequence of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A080257 Numbers having at least two distinct or a total of at least three prime factors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

PARI

Formula

Extensions

A113901 Product of omega(n) and bigomega(n) = A001221(n)*A001222(n), where omega(x): number of distinct prime divisors of x. bigomega(x): number of prime divisors of x, counted with multiplicity.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A325239 Irregular triangle read by rows where row 1 is {1} and row n > 1 is the sequence starting with n and repeatedly applying A181819 until 2 is reached.

Views