A304464 -id:A304464 - cp's OEIS frontend

A304634 Numbers n with prime omicron 2, meaning A304465(n) = 2.

4, 6, 9, 10, 12, 14, 15, 18, 20, 21, 22, 24, 25, 26, 28, 33, 34, 35, 36, 38, 39, 40, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 65, 68, 69, 72, 74, 75, 76, 77, 80, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99, 100, 104

Offset: 1

Gus Wiseman, May 15 2018

nonn

If n > 1 is not a prime number, we have A056239(n) >= Omega(n) >= omega(n) >= A071625(n) >= ... >= omicron(n) > 1 where Omega = A001222, omega = A001221, and omicron = A304465.

			This is a list of normalized factorizations (see A112798) of selected entries:
    4: {1,1}
    6: {1,2}
   12: {1,1,2}
   24: {1,1,1,2}
   36: {1,1,2,2}
   48: {1,1,1,1,2}
   60: {1,1,2,3}
   72: {1,1,1,2,2}
   96: {1,1,1,1,1,2}
  120: {1,1,1,2,3}
  144: {1,1,1,1,2,2}
  180: {1,1,2,2,3}
  192: {1,1,1,1,1,1,2}
  216: {1,1,1,2,2,2}
  240: {1,1,1,1,2,3}
  288: {1,1,1,1,1,2,2}
  384: {1,1,1,1,1,1,1,2}
  420: {1,1,2,3,4}
  432: {1,1,1,1,2,2,2}
  480: {1,1,1,1,1,2,3}
  576: {1,1,1,1,1,1,2,2}
  768: {1,1,1,1,1,1,1,1,2}
  840: {1,1,1,2,3,4}
  864: {1,1,1,1,1,2,2,2}
  960: {1,1,1,1,1,1,2,3}

Cf. A001221, A001222, A001358, A005117, A007774, A007916, A055932, A071625, A112798, A181819, A182850, A182857, A275870, A304464, A304465, A304636, A304647.

Join@@Position[Table[Switch[n,1,0,?PrimeQ,1,,NestWhile[Sort[Length/@Split[#]]&,Sort[Last/@FactorInteger[n]],Length[#]>1&]//First],{n,100}],2]

A304636 Numbers n with prime omicron 3, meaning A304465(n) = 3.

Original entry on oeis.org

8, 27, 30, 42, 66, 70, 78, 102, 105, 110, 114, 125, 130, 138, 154, 165, 170, 174, 182, 186, 190, 195, 222, 230, 231, 238, 246, 255, 258, 266, 273, 282, 285, 286, 290, 310, 318, 322, 343, 345, 354, 357, 360, 366, 370, 374, 385, 399, 402, 406, 410, 418, 426

Offset: 1

Gus Wiseman, May 15 2018

nonn

If n > 1 is not a prime number, we have A056239(n) >= Omega(n) >= omega(n) >= A071625(n) >= ... >= omicron(n) > 1 where Omega = A001222, omega = A001221, and omicron = A304465.

			This is a list of normalized factorizations (see A112798) of selected entries:
     8: {1,1,1}
    30: {1,2,3}
   360: {1,1,1,2,2,3}
   720: {1,1,1,1,2,2,3}
   900: {1,1,2,2,3,3}
  1440: {1,1,1,1,1,2,2,3}
  2160: {1,1,1,1,2,2,2,3}
  2880: {1,1,1,1,1,1,2,2,3}
  4320: {1,1,1,1,1,2,2,2,3}
  5760: {1,1,1,1,1,1,1,2,2,3}
  8640: {1,1,1,1,1,1,2,2,2,3}
Starting with A112798(1801800) and repeatedly taking the multiset of multiplicities we have {1,1,1,2,2,3,3,4,5,6} -> {1,1,1,2,2,3} -> {1,2,3} -> {1,1,1} -> {3}, so 1801800 belongs to the sequence.

Cf. A001221, A001222, A005117, A007916, A014612, A033992, A071625, A112798, A181819, A182850, A182857, A304464, A304465, A304634, A304647.

Join@@Position[Table[Switch[n,1,0,?PrimeQ,1,,NestWhile[Sort[Length/@Split[#]]&,Sort[Last/@FactorInteger[n]],Length[#]>1&]//First],{n,200}],3]

A353842 Last part of the trajectory of the partition run-sum transformation of n, using Heinz numbers.

Original entry on oeis.org

1, 2, 3, 3, 5, 6, 7, 5, 7, 10, 11, 7, 13, 14, 15, 7, 17, 14, 19, 15, 21, 22, 23, 15, 13, 26, 13, 21, 29, 30, 31, 11, 33, 34, 35, 21, 37, 38, 39, 13, 41, 42, 43, 33, 35, 46, 47, 21, 19, 26, 51, 39, 53, 26, 55, 35, 57, 58, 59, 35, 61, 62, 19, 13, 65, 66, 67, 51

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 corresponds to the partitions (2,1,1) -> (2,2) -> (4).

			The partition run-sum trajectory of 87780 is: 87780 -> 65835 -> 51205 -> 19855 -> 2915, so a(87780) = 2915.

The fixed points and image are A005117.
For run-lengths instead of sums we have A304464/A304465, counted by A325268.
These are the row-ends of A353840.
Other sequences pertaining to partition trajectory are A353841-A353846.
The version for compositions is A353855, run-ends of A353853.
A001222 counts prime factors, distinct A001221.
A056239 adds up prime indices, row sums of A112798 and A296150.
A182850 and A323014 give frequency depth.
A300273 ranks collapsible partitions, counted by A275870.
A353832 represents the operation of taking run-sums of a partition.
A353833 ranks partitions with all equal run-sums, counted by A304442.
A353835 counts distinct run-sums of prime indices, weak A353861.
A353866 ranks rucksack partitions, counted by A353864.
Cf. A071625, A073093, A181819, A325239, A325277, A353834, A353838, A353847, A353865, A353867.

Table[NestWhile[Times@@Prime/@Cases[If[#==1,{},FactorInteger[#]],{p_,k_}:>PrimePi[p]*k]&,n,!SquareFreeQ[#]&],{n,100}]

A304647 Smallest term of A304636 that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.

Original entry on oeis.org

5, 8, 30, 360, 1801800, 2746644314348614680000, 13268350773236509446586539974366689358164301703214270074935844483572035447570761114173070859428708074413696096366645684575600000000

Offset: 0

Gus Wiseman, May 15 2018

nonn

The first entry 5 is optional so has offset 0.

			The list of multisets with Heinz numbers in the sequence is the following. The number of k's in row n + 1 is equal to the k-th largest term of row n.
                     5: {3}
                     8: {1,1,1}
                    30: {1,2,3}
                   360: {1,1,1,2,2,3}
               1801800: {1,1,1,2,2,3,3,4,5,6}
2746644314348614680000: {1,1,1,1,1,1,2,2,2,2,2,3,3,3,3,4,4,4,5,5,5,6,6,7,7,8,9,10}

Cf. A001221, A001222, A001462, A012257, A014612, A033992, A071625, A112798, A181819, A182850, A182857, A275870, A304464, A304465, A304634, A304636.

Function[m,Times@@Prime/@m]/@NestList[Join@@Table[Table[i,{Reverse[#][[i]]}],{i,Length[#]}]&,{3},6]

A319152 Nonprime Heinz numbers of superperiodic integer partitions.

Original entry on oeis.org

9, 25, 27, 49, 81, 121, 125, 169, 243, 289, 343, 361, 441, 529, 625, 729, 841, 961, 1331, 1369, 1521, 1681, 1849, 2187, 2197, 2209, 2401, 2809, 3125, 3249, 3481, 3721, 4225, 4489, 4913, 5041, 5329, 6241, 6561, 6859, 6889, 7569, 7921, 8281, 9261, 9409, 10201

Offset: 1

Gus Wiseman, Sep 12 2018

nonn

A subsequence of A001597.
A number n is in the sequence iff n = 2 or the prime indices of n have a common divisor > 1 and the Heinz number of the multiset of prime multiplicities of n, namely A181819(n), is already in the sequence.
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

			The sequence of partitions whose Heinz numbers belong to the sequence begins: (22), (33), (222), (44), (2222), (55), (333), (66), (22222), (77), (444), (88), (4422), (99), (3333), (222222).

Cf. A001597, A056239, A072774, A181819, A182850, A289509, A296150, A298748, A304464, A305732, A317246, A317257, A319149, A319151.

supperQ[n_]:=Or[n==2,And[GCD@@PrimePi/@FactorInteger[n][[All,1]]>1,supperQ[Times@@Prime/@FactorInteger[n][[All,2]]]]];
Select[Range[10000],And[!PrimeQ[#],supperQ[#]]&]

A319157 Smallest Heinz number of a superperiodic integer partition requiring n steps in the reduction to a multiset of size 1 obtained by repeatedly taking the multiset of multiplicities.

Original entry on oeis.org

2, 3, 9, 441, 11865091329, 284788749974468882877009302517495014698593896453070311184452244729

Offset: 1

Gus Wiseman, Sep 12 2018

nonn

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

An integer partition is superperiodic if either it consists of a single part equal to 1 or its parts have a common divisor > 1 and its multiset of multiplicities is itself superperiodic. For example, (8,8,6,6,4,4,4,4,2,2,2,2) has multiplicities (4,4,2,2) with multiplicities (2,2) with multiplicities (2) with multiplicities (1). The first four of these partitions are periodic and the last is (1), so (8,8,6,6,4,4,4,4,2,2,2,2) is superperiodic.

Cf. A001462, A001597, A056239, A072774, A181819, A182850, A182857, A304455, A304464, A317246, A317257, A319149, A319151.

Function[m,Times@@Prime/@m]/@NestList[Join@@Table[Table[2i,{Reverse[#][[i]]}],{i,Length[#]}]&,{1},4]

cp's OEIS Frontend

A304634 Numbers n with prime omicron 2, meaning A304465(n) = 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A304636 Numbers n with prime omicron 3, meaning A304465(n) = 3.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A353842 Last part of the trajectory of the partition run-sum transformation of n, using Heinz numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A304647 Smallest term of A304636 that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A319152 Nonprime Heinz numbers of superperiodic integer partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A319157 Smallest Heinz number of a superperiodic integer partition requiring n steps in the reduction to a multiset of size 1 obtained by repeatedly taking the multiset of multiplicities.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica