A097318 -id:A097318 - cp's OEIS frontend

A182863 Members m of A025487 such that, if k appears in m's prime signature, k-1 appears at least as often as k (for any integer k > 1).

1, 2, 6, 12, 30, 60, 210, 360, 420, 1260, 2310, 2520, 4620, 13860, 27720, 30030, 60060, 75600, 138600, 180180, 360360, 510510, 831600, 900900, 1021020, 1801800, 3063060, 6126120, 9699690, 10810800, 15315300, 19399380, 30630600, 37837800

Offset: 1

Matthew Vandermast, Jan 14 2011

nonn

Members m of A025487 such that A181819(m) is also a member of A025487.
If prime signatures are considered as partitions, these are the members of A025487 whose prime signature is conjugate to the prime signature of a member of A181818.
Also the least number with each sorted prime metasignature, where a number's metasignature is the sequence of multiplicities of exponents in its prime factorization. For example, 2520 has prime indices {1,1,1,2,2,3,4}, sorted prime signature {1,1,2,3}, and sorted prime metasignature {1,1,2}. - Gus Wiseman, May 21 2022

			The prime signature of 360360 = 2^3*3^2*5*7*11*13 is (3,2,1,1,1,1). 2 appears as many times as 3 in 360360's prime signature, and 1 appears more times than 2. Since 360360 is also a member of A025487, it is a member of this sequence.
From _Gus Wiseman_, May 21 2022: (Start)
The terms together with their sorted prime signatures and sorted prime metasignatures begin:
      1: {}                -> {}            -> {}
      2: {1}               -> {1}           -> {1}
      6: {1,2}             -> {1,1}         -> {2}
     12: {1,1,2}           -> {1,2}         -> {1,1}
     30: {1,2,3}           -> {1,1,1}       -> {3}
     60: {1,1,2,3}         -> {1,1,2}       -> {1,2}
    210: {1,2,3,4}         -> {1,1,1,1}     -> {4}
    360: {1,1,1,2,2,3}     -> {1,2,3}       -> {1,1,1}
    420: {1,1,2,3,4}       -> {1,1,1,2}     -> {1,3}
   1260: {1,1,2,2,3,4}     -> {1,1,2,2}     -> {2,2}
   2310: {1,2,3,4,5}       -> {1,1,1,1,1}   -> {5}
   2520: {1,1,1,2,2,3,4}   -> {1,1,2,3}     -> {1,1,2}
   4620: {1,1,2,3,4,5}     -> {1,1,1,1,2}   -> {1,4}
  13860: {1,1,2,2,3,4,5}   -> {1,1,1,2,2}   -> {2,3}
  27720: {1,1,1,2,2,3,4,5} -> {1,1,1,2,3}   -> {1,1,3}
  30030: {1,2,3,4,5,6}     -> {1,1,1,1,1,1} -> {6}
  60060: {1,1,2,3,4,5,6}   -> {1,1,1,1,1,2} -> {1,5}
(End)

David A. Corneth, Table of n, a(n) for n = 1..10000 (first 1444 terms from Amiram Eldar)
Eric Weisstein's World of Mathematics, Conjugate Partition.

Intersection of A025487 and A179983.
Subsequence of A129912 and A181826.
Includes all members of A182862.
Positions of first appearances in A353742, unordered version A238747.
A001222 counts prime factors with multiplicity, distinct A001221.
A003963 gives product of prime indices.
A005361 gives product of prime signature, firsts A353500 (sorted A085629).
A056239 adds up prime indices, row sums of A112798 and A296150.
A124010 gives prime signature, sorted A118914.
A130091 lists numbers with distinct prime exponents, counted by A098859.
A181819 gives prime shadow, with an inverse A181821.
A182850 gives frequency depth of prime indices, counted by A225485.
A323014 gives adjusted frequency depth of prime indices, counted by A325280.
Cf. A000040, A055932, A070175, A097318, A304678, A325238, A353507, A353745.

nn=1000;
r=Table[Sort[Length/@Split[Sort[Last/@If[n==1,{},FactorInteger[n]]]]],{n,nn}];
Select[Range[nn],!MemberQ[Take[r,#-1],r[[#]]]&] (* Gus Wiseman, May 21 2022 *)

A329142 Numbers whose prime signature is not a necklace.

Original entry on oeis.org

1, 12, 20, 24, 28, 40, 44, 45, 48, 52, 56, 60, 63, 68, 72, 76, 80, 84, 88, 90, 92, 96, 99, 104, 112, 116, 117, 120, 124, 126, 132, 135, 136, 140, 144, 148, 152, 153, 156, 160, 164, 168, 171, 172, 175, 176, 180, 184, 188, 189, 192, 198, 200, 204, 207, 208, 212

Offset: 1

Gus Wiseman, Nov 09 2019

nonn

After a(1) = 1, first differs from A112769 in lacking 1350.
A number's prime signature (A124010) is the sequence of positive exponents in its prime factorization.
A necklace is a finite sequence that is lexicographically minimal among all of its cyclic rotations.

			The sequence of terms together with their prime signatures begins:
   1: ()
  12: (2,1)
  20: (2,1)
  24: (3,1)
  28: (2,1)
  40: (3,1)
  44: (2,1)
  45: (2,1)
  48: (4,1)
  52: (2,1)
  56: (3,1)
  60: (2,1,1)
  63: (2,1)
  68: (2,1)
  72: (3,2)
  76: (2,1)
  80: (4,1)
  84: (2,1,1)
  88: (3,1)
  90: (1,2,1)
  92: (2,1)

Complement of A329138.
Binary necklaces are A000031.
Non-necklace compositions are A329145.
Numbers whose reversed binary expansion is a necklace are A328595.
Numbers whose prime signature is a Lyndon word are A329131.
Numbers whose prime signature is periodic are A329140.
Cf. A001037, A008965, A025487, A056239, A097318, A112798, A118914, A124010, A181819, A304678, A328596, A329139.

neckQ[q_]:=Array[OrderedQ[{q,RotateRight[q,#]}]&,Length[q]-1,1,And];
Select[Range[100],#==1||!neckQ[Last/@FactorInteger[#]]&]

A097319 Numbers with more than one prime factor and, in the ordered factorization, the exponents are strictly increasing.

Original entry on oeis.org

18, 50, 54, 75, 98, 108, 147, 162, 242, 245, 250, 324, 338, 363, 375, 486, 500, 507, 578, 605, 648, 686, 722, 845, 847, 867, 972, 1029, 1058, 1083, 1125, 1183, 1250, 1372, 1445, 1458, 1587, 1682, 1715, 1805, 1859, 1875, 1922, 1944, 2023, 2250

Offset: 1

Ralf Stephan, Aug 04 2004

nonn

If n = Product[k=1..m, p(k)^e(k)], then m>1 and e(1) < e(2) <...< e(m).

			507 is 3^1*13^2, A001221(507)=2 and 1<2, so 507 is in sequence.
150 is 2^1*3^1*5^2 is not in the sequence because 1,1,2 is not strictly increasing (although it is nondecreasing).

T. D. Noe, Table of n, a(n) for n = 1..1180

Subset of A126706. Cf. A097318, A097320.

fQ[n_] := Module[{d, f = FactorInteger[n]}, If[Length[f] == 1, False, d = Differences[Transpose[f][[2]]]; And @@ ((# > 0) & /@ d)]]; Select[Range[2250], fQ] (* T. D. Noe, Apr 09 2013 *)

for(n=1, 3000, F=factor(n); t=0; s=matsize(F)[1]; if(s>1, for(k=1, s-1, if(F[k, 2]>=F[k+1, 2], t=1; break)); if(!t, print1(n", "))))

is(n) = my(f = factor(n)[,2]); #f > 1 && vecsort(f, , 8) == f \\ Rick L. Shepherd, Jan 17 2018

A230766 Numbers with more than one prime factor and, in the ordered factorization, the exponent never decreases when read from left to right.

Original entry on oeis.org

6, 10, 14, 15, 18, 21, 22, 26, 30, 33, 34, 35, 36, 38, 39, 42, 46, 50, 51, 54, 55, 57, 58, 62, 65, 66, 69, 70, 74, 75, 77, 78, 82, 85, 86, 87, 91, 93, 94, 95, 98, 100, 102, 105, 106, 108, 110, 111, 114, 115, 118, 119, 122, 123, 129, 130, 133, 134, 138, 141

Offset: 1

Alex Ratushnyak, Oct 29 2013

nonn

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A097318, A097319, A097320.

filter:= proc(n) local F;
  F:= sort(ifactors(n)[2],(a,b) -> a[1] < b[1]);
  if nops(F) = 1 then return false fi;
  F:= F[..,2];
  F = sort(F)
end proc:
select(filter, [$2..200]); # Robert Israel, Feb 07 2025

fQ[n_] := Module[{f = Transpose[FactorInteger[n]][[2]]}, Length[f] > 1 && Min[Differences[f]] >= 0]; Select[Range[2, 200], fQ] (* T. D. Noe, Nov 04 2013 *)
Select[Range[150],PrimeNu[#]>1&&Min[Differences[FactorInteger[#][[All,2]]]]>=0&] (* Harvey P. Dale, May 22 2020 *)

isok(n) = {my(f = factor(n), nbf = #f~); if (nbf < 2, return (0)); lastexp = 0; for (i=1, nbf, if ((newexp = f[i, 2]) < lastexp, return (0)); lastexp = newexp;); return (1);} \\ Michel Marcus, Oct 30 2013

If n = Product_{k=1..m} p(k)^e(k), then m > 1 and e(1) <= e(2) <= ... <= e(m).

A353745 Number of runs in the ordered prime signature of n.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1

Offset: 1

Gus Wiseman, May 20 2022

nonn

First differs from A071625 at a(90) = 3.
First differs from A331592 at a(90) = 3.
A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization.

			The prime indices of 630 are {1,2,2,3,4}, with multiplicities {1,2,1,1}, with runs {{1},{2},{1,1}}, so a(630) = 3.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Mathematics Stack Exchange, What is a sequence run? (answered 2011-12-01)
Index entries for sequences related to prime indices in the factorization of n.

Positions of first appearances are A354233.
A001222 counts prime factors, distinct A001221.
A005361 gives product of prime signature, firsts A353500/A085629.
A056239 adds up prime indices, row sums of A112798 and A296150.
A124010 gives prime signature, sorted A118914.
A181819 gives prime shadow, with an inverse A181821.
A182850/A323014 give frequency depth, counted by A225485/A325280.
Cf. A005811, A097318, A130091, A304678, A333755, A353503, A353507, A353742.
Cf. also A329747.

Table[Length[Split[Last/@If[n==1,{},FactorInteger[n]]]],{n,100}]

pis_to_runs(n) = { my(runs=List([]), f=factor(n)); for(i=1,#f~,while(f[i,2], listput(runs,primepi(f[i,1])); f[i,2]--)); (runs); };
runlengths(lista) = if(!#lista, lista, if(1==#lista, List([1]), my(runs=List([]), rl=1); for(i=1, #lista, if((i < #lista) && (lista[i]==lista[i+1]), rl++, listput(runs,rl); rl=1)); (runs)));
A353745(n) = #runlengths(runlengths(pis_to_runs(n))); \\ Antti Karttunen, Jan 20 2025

A334298 Numbers whose prime signature is a reversed Lyndon word.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 16, 17, 19, 20, 23, 24, 25, 27, 28, 29, 31, 32, 37, 40, 41, 43, 44, 45, 47, 48, 49, 52, 53, 56, 59, 60, 61, 63, 64, 67, 68, 71, 72, 73, 76, 79, 80, 81, 83, 84, 88, 89, 92, 96, 97, 99, 101, 103, 104, 107, 109, 112, 113, 116

Offset: 1

Gus Wiseman, Jun 10 2020

nonn

A Lyndon word is a finite sequence that is lexicographically strictly less than all of its cyclic rotations.

A number's prime signature is the sequence of positive exponents in its prime factorization.

			The prime signature of 4200 is (3,1,2,1), which is a reversed Lyndon word, so 4200 is in the sequence.
The sequence of terms together with their prime indices begins:
   1: {}           23: {9}            48: {1,1,1,1,2}
   2: {1}          24: {1,1,1,2}      49: {4,4}
   3: {2}          25: {3,3}          52: {1,1,6}
   4: {1,1}        27: {2,2,2}        53: {16}
   5: {3}          28: {1,1,4}        56: {1,1,1,4}
   7: {4}          29: {10}           59: {17}
   8: {1,1,1}      31: {11}           60: {1,1,2,3}
   9: {2,2}        32: {1,1,1,1,1}    61: {18}
  11: {5}          37: {12}           63: {2,2,4}
  12: {1,1,2}      40: {1,1,1,3}      64: {1,1,1,1,1,1}
  13: {6}          41: {13}           67: {19}
  16: {1,1,1,1}    43: {14}           68: {1,1,7}
  17: {7}          44: {1,1,5}        71: {20}
  19: {8}          45: {2,2,3}        72: {1,1,1,2,2}
  20: {1,1,3}      47: {15}           73: {21}

The non-reversed version is A329131.
Lyndon compositions are A059966.
Prime signature is A124010.
Numbers with strictly decreasing prime multiplicities are A304686.
Numbers whose reversed binary expansion is Lyndon are A328596.
Numbers whose prime signature is a necklace are A329138.
Numbers whose prime signature is aperiodic are A329139.
Cf. A000031, A000740, A000961, A001037, A025487, A027375, A097318, A112798, A118914, A304678, A318731, A329140, A329142.

lynQ[q_]:=Length[q]==0||Array[Union[{q,RotateRight[q,#1]}]=={q,RotateRight[q,#1]}&,Length[q]-1,1,And];
Select[Range[100],lynQ[Reverse[Last/@If[#==1,{},FactorInteger[#]]]]&]

A353504 Number of integer partitions of n whose product is less than the product of their multiplicities.

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 9, 11, 12, 14, 14, 18, 21, 23, 26, 29, 29, 33, 36, 39, 40, 43, 44, 50, 53, 55, 59, 65, 69, 72, 78, 79, 81, 85, 92, 95, 97, 100, 103, 108, 109, 112, 118, 124, 129, 137, 139, 142, 149, 155, 159, 165, 166, 173, 178, 181, 187

Offset: 0

Gus Wiseman, May 19 2022

nonn

			The a(2) = 1 through a(9) = 6 partitions:
  11   111   1111   2111    21111    22111     221111     222111
                    11111   111111   31111     311111     411111
                                     211111    2111111    2211111
                                     1111111   11111111   3111111
                                                          21111111
                                                          111111111

LHS (product of parts) is counted by A339095, ranked by A003963.
RHS (product of multiplicities) is counted by A266477, ranked by A005361.
The version for greater instead of less is A353505.
The version for equal instead of less is A353506, ranked by A353503.
A181819 gives prime shadow, with an inverse A181821.
A353398 counts partitions with the same product of multiplicities as of shadows, ranked by A353399.
Cf. A002033, A008284, A085629, A097318, A098859, A114640, A116608, A118914, A124010, A304678, A353394, A353500, A353507.

Table[Length[Select[IntegerPartitions[n],Times@@#

A353505 Number of integer partitions of n whose product is greater than the product of their multiplicities.

Original entry on oeis.org

0, 0, 1, 2, 3, 5, 7, 11, 17, 24, 35, 47, 66, 89, 121, 162, 214, 276, 362, 464, 599, 763, 971, 1219, 1537, 1918, 2393, 2966, 3668, 4512, 5549, 6784, 8287, 10076, 12238, 14807, 17898, 21556, 25931, 31094, 37243, 44486, 53075, 63158, 75069, 89025, 105447, 124636

Offset: 0

Gus Wiseman, May 19 2022

nonn

			The a(0) = 0 through a(7) = 11 partitions:
  .  .  (2)  (3)   (4)   (5)    (6)    (7)
             (21)  (22)  (32)   (33)   (43)
                   (31)  (41)   (42)   (52)
                         (221)  (51)   (61)
                         (311)  (222)  (322)
                                (321)  (331)
                                (411)  (421)
                                       (511)
                                       (2221)
                                       (3211)
                                       (4111)

RHS (product of multiplicities) is counted by A266477, ranked by A005361.
LHS (product of parts) is counted by A339095, ranked by A003963.
The version for less instead of greater is A353504.
The version for equality is A353506, ranked by A353503.
A124010 gives prime signature, sorted A118914.
A181819 gives prime shadow, with an inverse A181821.
A353398 counts partitions with the same products of multiplicities as of shadows, ranked by A353399.
Cf. A002033, A008284, A008619, A085629, A097318, A098859, A114640, A116608, A130091, A304678, A353394, A353507.

Table[Length[Select[IntegerPartitions[n],Times@@#>Times@@Length/@Split[#]&]],{n,0,30}]

A354233 Least number with n runs in ordered prime signature.

Original entry on oeis.org

1, 2, 12, 90, 2100, 48510, 3303300, 139369230, 18138420300, 1157182716690, 278261505822300, 30168910606824990, 9894144362523521100, 1693350783450479863710, 715178436956287675671300, 147157263134197051595990130, 83730945863531292204568790100

Offset: 0

Gus Wiseman, May 20 2022

nonn

A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization.

			The prime indices of 90 are {1,2,2,3}, with multiplicities {1,2,1}, with runs {{1},{2},{1}}, and this is the first case of 3 runs, so a(3) = 90.

Mathematics Stack Exchange, What is a sequence run? (answered 2011-12-01)

Positions of first appearances in A353745.
A001222 counts prime factors with multiplicity, distinct A001221.
A005361 gives product of signature, firsts A353500 (sorted A085629).
A056239 adds up prime indices, row sums of A112798 and A296150.
A124010 gives prime signature, sorted A118914.
A130091 lists numbers with distinct prime exponents, counted by A098859.
A181819 gives prime shadow, with an inverse A181821.
A182850 gives frequency depth of prime indices, counted by A225485.
A323014 gives adjusted frequency depth of prime indices, counted by A325280.
Cf. A005811, A097318, A304678, A325755, A353507, A353742.

Table[Product[Prime[i]^If[EvenQ[n-i],1,2],{i,n}],{n,0,15}]

cp's OEIS Frontend

A182863 Members m of A025487 such that, if k appears in m's prime signature, k-1 appears at least as often as k (for any integer k > 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A329142 Numbers whose prime signature is not a necklace.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A097319 Numbers with more than one prime factor and, in the ordered factorization, the exponents are strictly increasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

A230766 Numbers with more than one prime factor and, in the ordered factorization, the exponent never decreases when read from left to right.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A353745 Number of runs in the ordered prime signature of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A334298 Numbers whose prime signature is a reversed Lyndon word.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A353504 Number of integer partitions of n whose product is less than the product of their multiplicities.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A353505 Number of integer partitions of n whose product is greater than the product of their multiplicities.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A354233 Least number with n runs in ordered prime signature.