A118914 -id:A118914 - cp's OEIS frontend

A335460 Number of (1,2,1) or (2,1,2)-matching permutations of the prime indices of n.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 0, 0, 6, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 8, 0, 0, 1, 1, 0, 0, 0, 3, 0, 0, 0, 6, 0, 0, 0

Offset: 1

Gus Wiseman, Jun 20 2020

nonn

Depends only on sorted prime signature (A118914).
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
We define a pattern to be a finite sequence covering an initial interval of positive integers. Patterns are counted by A000670 and ranked by A333217. A sequence S is said to match a pattern P if there is a not necessarily contiguous subsequence of S whose parts have the same relative order as P. For example, (3,1,1,3) matches (1,1,2), (2,1,1), and (2,1,2), but avoids (1,2,1), (1,2,2), and (2,2,1).

			The a(n) compositions for n = 12, 24, 48, 36, 60, 72:
  (121)  (1121)  (11121)  (1212)  (1213)  (11212)
         (1211)  (11211)  (1221)  (1231)  (11221)
                 (12111)  (2112)  (1312)  (12112)
                          (2121)  (1321)  (12121)
                                  (2131)  (12211)
                                  (3121)  (21112)
                                          (21121)
                                          (21211)

Wikipedia, Permutation pattern
Gus Wiseman, Sequences counting and ranking compositions by the patterns they match or avoid.

Positions of zeros are A303554.
The (1,2,1)-matching part is A335446.
The (2,1,2)-matching part is A335453.
Replacing "or" with "and" gives A335462.
Permutations of prime indices are counted by A008480.
Unsorted prime signature is A124010. Sorted prime signature is A118914.
STC-numbers of permutations of prime indices are A333221.
(1,2,1) and (2,1,2)-avoiding permutations of prime indices are A333175.
Patterns matched by standard compositions are counted by A335454.
(1,2,1) and (2,1,2)-matching permutations of prime indices are A335462.
Dimensions of downsets of standard compositions are A335465.
Cf. A056239, A056986, A112798, A158005, A181796, A335451, A335452, A335463.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Permutations[primeMS[n]],MatchQ[#,{_,x_,_,y_,_,x_,_}/;x!=y]&]],{n,100}]

A336571 Number of sets of divisors d|n, 1 < d < n, all belonging to A130091 (numbers with distinct prime multiplicities) and forming a divisibility chain.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 1, 4, 2, 3, 1, 5, 1, 3, 3, 8, 1, 5, 1, 5, 3, 3, 1, 14, 2, 3, 4, 5, 1, 4, 1, 16, 3, 3, 3, 17, 1, 3, 3, 14, 1, 4, 1, 5, 5, 3, 1, 36, 2, 5, 3, 5, 1, 14, 3, 14, 3, 3, 1, 16, 1, 3, 5, 32, 3, 4, 1, 5, 3, 4, 1, 35, 1, 3, 5, 5, 3, 4, 1, 36, 8, 3, 1

Offset: 1

Gus Wiseman, Jul 29 2020

nonn

A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization, so a number has distinct prime multiplicities iff all the exponents in its prime signature are distinct.

			The a(n) sets for n = 4, 6, 12, 16, 24, 84, 36:
  {}   {}   {}     {}       {}        {}        {}
  {2}  {2}  {2}    {2}      {2}       {2}       {2}
       {3}  {3}    {4}      {3}       {3}       {3}
            {4}    {8}      {4}       {4}       {4}
            {2,4}  {2,4}    {8}       {7}       {9}
                   {2,8}    {12}      {12}      {12}
                   {4,8}    {2,4}     {28}      {18}
                   {2,4,8}  {2,8}     {2,4}     {2,4}
                            {4,8}     {2,12}    {3,9}
                            {2,12}    {2,28}    {2,12}
                            {3,12}    {3,12}    {2,18}
                            {4,12}    {4,12}    {3,12}
                            {2,4,8}   {4,28}    {3,18}
                            {2,4,12}  {7,28}    {4,12}
                                      {2,4,12}  {9,18}
                                      {2,4,28}  {2,4,12}
                                                {3,9,18}

A336423 is the version for chains containing n.
A336570 is the maximal version.
A000005 counts divisors.
A001055 counts factorizations.
A007425 counts divisors of divisors.
A032741 counts proper divisors.
A045778 counts strict factorizations.
A071625 counts distinct prime multiplicities.
A074206 counts strict chains of divisors from n to 1.
A130091 lists numbers with distinct prime multiplicities.
A181796 counts divisors with distinct prime multiplicities.
A253249 counts chains of divisors.
A336422 counts divisible pairs of divisors, both in A130091.
A336424 counts factorizations using A130091.
A336500 counts divisors of n in A130091 with quotient also in A130091.
Cf. A001222, A002033, A005117, A098859, A118914, A124010, A294068, A305149, A327498, A327523, A336568, A336569.

strchns[n_]:=If[n==1,1,Sum[strchns[d],{d,Select[Most[Divisors[n]],UnsameQ@@Last/@FactorInteger[#]&]}]];
Table[strchns[n],{n,100}]

A352826 Heinz numbers of integer partitions y without a fixed point y(i) = i. Such a fixed point is unique if it exists.

Original entry on oeis.org

1, 3, 5, 6, 7, 10, 11, 12, 13, 14, 17, 19, 20, 22, 23, 24, 25, 26, 28, 29, 31, 34, 35, 37, 38, 40, 41, 43, 44, 46, 47, 48, 49, 50, 52, 53, 55, 56, 58, 59, 61, 62, 65, 67, 68, 70, 71, 73, 74, 75, 76, 77, 79, 80, 82, 83, 85, 86, 88, 89, 91, 92, 94, 95, 96, 97

Offset: 1

Gus Wiseman, Apr 06 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 terms together with their prime indices begin:
      1: ()          24: (2,1,1,1)     47: (15)
      3: (2)         25: (3,3)         48: (2,1,1,1,1)
      5: (3)         26: (6,1)         49: (4,4)
      6: (2,1)       28: (4,1,1)       50: (3,3,1)
      7: (4)         29: (10)          52: (6,1,1)
     10: (3,1)       31: (11)          53: (16)
     11: (5)         34: (7,1)         55: (5,3)
     12: (2,1,1)     35: (4,3)         56: (4,1,1,1)
     13: (6)         37: (12)          58: (10,1)
     14: (4,1)       38: (8,1)         59: (17)
     17: (7)         40: (3,1,1,1)     61: (18)
     19: (8)         41: (13)          62: (11,1)
     20: (3,1,1)     43: (14)          65: (6,3)
     22: (5,1)       44: (5,1,1)       67: (19)
     23: (9)         46: (9,1)         68: (7,1,1)

* = unproved
*These partitions are counted by A064428, strict A352828.
The complement is A352827.
The reverse version is A352830, counted by A238394.
A000700 counts self-conjugate partitions, ranked by A088902.
A001222 counts prime indices, distinct A001221.
*A001522 counts partitions with a fixed point.
A008290 counts permutations by fixed points, nonfixed A098825.
A056239 adds up prime indices, row sums of A112798 and A296150.
A115720 and A115994 count partitions by their Durfee square.
A122111 represents partition conjugation using Heinz numbers.
A124010 gives prime signature, sorted A118914.
A238349 counts compositions by fixed points, complement A352523.
A238352 counts reversed partitions by fixed points, rank statistic A352822.
A238395 counts reversed partitions with a fixed point, ranked by A352872.
A352833 counts partitions by fixed points.
Cf. A062457, A064410, A065770, A093641, A257990, A342192, A352486, A352823, A352824, A352825, A352831, A352832.

pq[y_]:=Length[Select[Range[Length[y]],#==y[[#]]&]];
Select[Range[100],pq[Reverse[Flatten[Cases[FactorInteger[#],{p_,k_}:>Table[PrimePi[p],{k}]]]]]==0&]

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

Original entry on oeis.org

6, 10, 12, 14, 15, 20, 21, 22, 24, 26, 28, 30, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 51, 52, 55, 56, 57, 58, 60, 62, 63, 65, 66, 68, 69, 70, 72, 74, 76, 77, 78, 80, 82, 84, 85, 86, 87, 88, 91, 92, 93, 94, 95, 96, 99, 100, 102, 104, 105, 106, 110, 111, 112, 114

Offset: 1

Ralf Stephan, Aug 04 2004

nonn

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

These are numbers whose ordered prime signature is weakly decreasing. Weakly increasing is A304678. Ordered prime signature is A124010. - Gus Wiseman, Nov 10 2019

			60 is 2^2*3^1*5^1, A001221(60)=3 and 2>=1>=1, so 60 is in sequence.

Alois P. Heinz, Table of n, a(n) for n = 1..20000
S. Ramanujan, Asymptotic formulas for the distribution of integers of various types, Proc. London Math. Soc. 2, 16 (1917), 112-132.

Subset of A024619. Cf. A097319, A097320, A230766.

Cf. A001222, A025487, A118914, A124010, A304678, A329138, A329142.

q:= n-> (l-> (t-> t>1 and andmap(i-> l[i, 2]>=l[i+1, 2],
        [$1..t-1]))(nops(l)))(sort(ifactors(n)[2])):
select(q, [$1..120])[];  # Alois P. Heinz, Nov 11 2019

fQ[n_] := Module[{f = Transpose[FactorInteger[n]][[2]]}, Length[f] > 1 && Max[Differences[f]] <= 0]; Select[Range[2, 200], fQ] (* T. D. Noe, Nov 04 2013 *)

for(n=1, 130, F=factor(n); t=0; s=matsize(F)[1]; if(s>1, for(k=1, s-1, if(F[k, 2]

A325508 Product of primes indexed by the prime exponents of n!.

Original entry on oeis.org

1, 1, 2, 4, 10, 20, 42, 84, 204, 476, 798, 1596, 3828, 7656, 12276, 24180, 36660, 73320, 120840, 241680, 389424, 785680, 1294440, 2588880, 3848880, 7147920, 11264760, 15926040, 26057304, 52114608, 74421648, 148843296, 187159392, 340949280, 527531760, 926505360

Offset: 0

Gus Wiseman, May 08 2019

nonn

The prime indices of a(n) are the signature of n!, which is row n of A115627.

			We have 7! = 2^4 * 3^2 * 5^1 * 7^1, so a(7) = prime(4)*prime(2)*prime(1)*prime(1) = 84.
The sequence of terms together with their prime indices begins:
          1: {}
          1: {}
          2: {1}
          4: {1,1}
         10: {1,3}
         20: {1,1,3}
         42: {1,2,4}
         84: {1,1,2,4}
        204: {1,1,2,7}
        476: {1,1,4,7}
        798: {1,2,4,8}
       1596: {1,1,2,4,8}
       3828: {1,1,2,5,10}
       7656: {1,1,1,2,5,10}
      12276: {1,1,2,2,5,11}
      24180: {1,1,2,3,6,11}
      36660: {1,1,2,3,6,15}
      73320: {1,1,1,2,3,6,15}
     120840: {1,1,1,2,3,8,16}
     241680: {1,1,1,1,2,3,8,16}

Cf. A000142, A011371, A022559, A056171, A071626, A076934, A115627, A118914, A122111, A135291, A181819, A307035, A323014, A325272, A325273, A325276, A325509.

Table[Times@@Prime/@Last/@If[(n!)==1,{},FactorInteger[n!]],{n,0,30}]

a(n) = A181819(n!).
A001221(a(n)) = A071626(n).
A001222(a(n)) = A000720(n).
A056239(a(n)) = A022559(n).
A003963(a(n)) = A135291(n).
A061395(a(n)) = A011371(n).
A007814(a(n)) = A056171(n).
a(n) = A122111(A307035(n)). - Antti Karttunen, Nov 19 2019

A335462 Number of (1,2,1) and (2,1,2)-matching permutations of the prime indices of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Gus Wiseman, Jun 20 2020

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

We define a pattern to be a finite sequence covering an initial interval of positive integers. Patterns are counted by A000670 and ranked by A333217. A sequence S is said to match a pattern P if there is a not necessarily contiguous subsequence of S whose parts have the same relative order as P. For example, (3,1,1,3) matches (1,1,2), (2,1,1), and (2,1,2), but avoids (1,2,1), (1,2,2), and (2,2,1).

			The a(n) permutations for n = 36, 72, 270, 144, 300:
  (1,2,1,2)  (1,1,2,1,2)  (2,1,2,3,2)  (1,1,1,2,1,2)  (1,2,3,1,3)
  (2,1,2,1)  (1,2,1,1,2)  (2,1,3,2,2)  (1,1,2,1,1,2)  (1,3,1,2,3)
             (1,2,1,2,1)  (2,2,1,3,2)  (1,1,2,1,2,1)  (1,3,1,3,2)
             (2,1,1,2,1)  (2,2,3,1,2)  (1,2,1,1,1,2)  (1,3,2,1,3)
             (2,1,2,1,1)  (2,3,1,2,2)  (1,2,1,1,2,1)  (1,3,2,3,1)
                          (2,3,2,1,2)  (1,2,1,2,1,1)  (2,1,3,1,3)
                                       (2,1,1,1,2,1)  (2,3,1,3,1)
                                       (2,1,1,2,1,1)  (3,1,2,1,3)
                                       (2,1,2,1,1,1)  (3,1,2,3,1)
                                                      (3,1,3,1,2)
                                                      (3,1,3,2,1)
                                                      (3,2,1,3,1)

Wikipedia, Permutation pattern
Gus Wiseman, Sequences counting and ranking compositions by the patterns they match or avoid.

The avoiding version is A333175.
Replacing "and" with "or" gives A335460.
Positions of nonzero terms are A335463.
Permutations of prime indices are counted by A008480.
Unsorted prime signature is A124010. Sorted prime signature is A118914.
STC-numbers of permutations of prime indices are A333221.
Patterns matched by standard compositions are counted by A335454.
Dimensions of downsets of standard compositions are A335465.
Cf. A056239, A056986, A112798, A158005, A181796, A335451, A335452.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Permutations[primeMS[n]],MatchQ[#,{_,x_,_,y_,_,x_,_}/;x_,x_,_,y_,_,x_,_}/;x>y]&]],{n,100}]

A335463 Numbers k such that there exists a permutation of the prime indices of k matching both (1,2,1) and (2,1,2).

Original entry on oeis.org

36, 72, 90, 100, 108, 126, 144, 180, 196, 198, 200, 216, 225, 234, 252, 270, 288, 300, 306, 324, 342, 350, 360, 378, 392, 396, 400, 414, 432, 441, 450, 468, 484, 500, 504, 522, 525, 540, 550, 558, 576, 588, 594, 600, 612, 630, 648, 650, 666, 675, 676, 684, 700

Offset: 1

Gus Wiseman, Jun 20 2020

nonn

A prime index of k is a number m such that prime(m) divides k. The multiset of prime indices of k is row k of A112798.

We define a pattern to be a finite sequence covering an initial interval of positive integers. Patterns are counted by A000670 and ranked by A333217. A sequence S is said to match a pattern P if there is a not necessarily contiguous subsequence of S whose parts have the same relative order as P. For example, (3,1,1,3) matches (1,1,2), (2,1,1), and (2,1,2), but avoids (1,2,1), (1,2,2), and (2,2,1).

			The sequence of terms together with their prime indices begins:
   36: {1,1,2,2}
   72: {1,1,1,2,2}
   90: {1,2,2,3}
  100: {1,1,3,3}
  108: {1,1,2,2,2}
  126: {1,2,2,4}
  144: {1,1,1,1,2,2}
  180: {1,1,2,2,3}
  196: {1,1,4,4}
  198: {1,2,2,5}
  200: {1,1,1,3,3}
  216: {1,1,1,2,2,2}
  225: {2,2,3,3}
  234: {1,2,2,6}
  252: {1,1,2,2,4}
  270: {1,2,2,2,3}
  288: {1,1,1,1,1,2,2}
  300: {1,1,2,3,3}

Wikipedia, Permutation pattern
Gus Wiseman, Sequences counting and ranking compositions by the patterns they match or avoid.

Replacing "and" with "or" gives A126706.
Positions of nonzero terms in A335462.
Permutations of prime indices are counted by A008480.
Unsorted prime signature is A124010. Sorted prime signature is A118914.
STC-numbers of permutations of prime indices are A333221.
Patterns matched by standard compositions are counted by A335454.
Cf. A056239, A056986, A112798, A158005, A181796, A333175, A335451, A335452, A335460, A335465.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Select[Permutations[primeMS[#]],MatchQ[#,{_,x_,_,y_,_,x_,_}/;x_,x_,_,y_,_,x_,_}/;x>y]&]!={}&]

A336423 Number of strict chains of divisors from n to 1 using terms of A130091 (numbers with distinct prime multiplicities).

Original entry on oeis.org

1, 1, 1, 2, 1, 0, 1, 4, 2, 0, 1, 5, 1, 0, 0, 8, 1, 5, 1, 5, 0, 0, 1, 14, 2, 0, 4, 5, 1, 0, 1, 16, 0, 0, 0, 0, 1, 0, 0, 14, 1, 0, 1, 5, 5, 0, 1, 36, 2, 5, 0, 5, 1, 14, 0, 14, 0, 0, 1, 0, 1, 0, 5, 32, 0, 0, 1, 5, 0, 0, 1, 35, 1, 0, 5, 5, 0, 0, 1, 36, 8, 0, 1, 0

Offset: 1

Gus Wiseman, Jul 27 2020

nonn

A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization, so a number has distinct prime multiplicities iff all the exponents in its prime signature are distinct.

			The a(n) chains for n = 4, 8, 12, 16, 24, 32:
  4/1    8/1      12/1      16/1        24/1         32/1
  4/2/1  8/2/1    12/2/1    16/2/1      24/2/1       32/2/1
         8/4/1    12/3/1    16/4/1      24/3/1       32/4/1
         8/4/2/1  12/4/1    16/8/1      24/4/1       32/8/1
                  12/4/2/1  16/4/2/1    24/8/1       32/16/1
                            16/8/2/1    24/12/1      32/4/2/1
                            16/8/4/1    24/4/2/1     32/8/2/1
                            16/8/4/2/1  24/8/2/1     32/8/4/1
                                        24/8/4/1     32/16/2/1
                                        24/12/2/1    32/16/4/1
                                        24/12/3/1    32/16/8/1
                                        24/12/4/1    32/8/4/2/1
                                        24/8/4/2/1   32/16/4/2/1
                                        24/12/4/2/1  32/16/8/2/1
                                                     32/16/8/4/1
                                                     32/16/8/4/2/1

A336569 is the maximal case.
A336571 does not require n itself to have distinct prime multiplicities.
A000005 counts divisors.
A007425 counts divisors of divisors.
A074206 counts strict chains of divisors from n to 1.
A130091 lists numbers with distinct prime multiplicities.
A181796 counts divisors with distinct prime multiplicities.
A253249 counts nonempty strict chains of divisors.
A327498 gives the maximum divisor with distinct prime multiplicities.
A336422 counts divisible pairs of divisors, both in A130091.
A336424 counts factorizations using A130091.
A336500 counts divisors of n in A130091 with quotient also in A130091.
A337256 counts strict chains of divisors.
Cf. A001055, A002033, A005117, A032741, A067824, A071625, A118914, A124010, A167865, A336568, A336570, A336941.

strchns[n_]:=If[n==1,1,If[!UnsameQ@@Last/@FactorInteger[n],0,Sum[strchns[d],{d,Select[Most[Divisors[n]],UnsameQ@@Last/@FactorInteger[#]&]}]]];
Table[strchns[n],{n,100}]

A352830 Numbers whose weakly increasing prime indices y have no fixed points y(i) = i.

Original entry on oeis.org

1, 3, 5, 7, 11, 13, 15, 17, 19, 21, 23, 25, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 77, 79, 83, 85, 87, 89, 91, 93, 95, 97, 101, 103, 105, 107, 109, 111, 113, 115, 119, 121, 123, 127, 129, 131, 133, 137, 139, 141

Offset: 1

Gus Wiseman, Apr 06 2022

nonn

First differs from A325128 in lacking 75.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
All terms are odd.

			The terms together with their prime indices begin:
      1: {}        35: {3,4}     69: {2,9}     105: {2,3,4}
      3: {2}       37: {12}      71: {20}      107: {28}
      5: {3}       39: {2,6}     73: {21}      109: {29}
      7: {4}       41: {13}      77: {4,5}     111: {2,12}
     11: {5}       43: {14}      79: {22}      113: {30}
     13: {6}       47: {15}      83: {23}      115: {3,9}
     15: {2,3}     49: {4,4}     85: {3,7}     119: {4,7}
     17: {7}       51: {2,7}     87: {2,10}    121: {5,5}
     19: {8}       53: {16}      89: {24}      123: {2,13}
     21: {2,4}     55: {3,5}     91: {4,6}     127: {31}
     23: {9}       57: {2,8}     93: {2,11}    129: {2,14}
     25: {3,3}     59: {17}      95: {3,8}     131: {32}
     29: {10}      61: {18}      97: {25}      133: {4,8}
     31: {11}      65: {3,6}    101: {26}      137: {33}
     33: {2,5}     67: {19}     103: {27}      139: {34}

* = unproved
These partitions are counted by A238394, strict A025147.
These are the zeros of A352822.
*The reverse version is A352826, counted by A064428 (strict A352828).
*The complement reverse version is A352827, counted by A001522.
The complement is A352872, counted by A238395.
A000700 counts self-conjugate partitions, ranked by A088902.
A001222 counts prime indices, distinct A001221.
A008290 counts permutations by fixed points, nonfixed A098825.
A056239 adds up prime indices, row sums of A112798 and A296150.
A114088 counts partitions by excedances.
A115720 and A115994 count partitions by their Durfee square.
A122111 represents partition conjugation using Heinz numbers.
A124010 gives prime signature, sorted A118914, conjugate rank A238745.
A238349 counts compositions by fixed points, complement A352523.
A238352 counts reversed partitions by fixed points.
A352833 counts partitions by fixed points.
Cf. A062457, A064410, A065770, A093641, A257990, A342192, A352486, A352823, A352824, A352825, A352831.

pq[y_]:=Length[Select[Range[Length[y]],#==y[[#]]&]];
Select[Range[100],pq[Flatten[Cases[FactorInteger[#],{p_,k_}:>Table[PrimePi[p],{k}]]]]==0&]

A352872 Numbers whose weakly increasing prime indices y have a fixed point y(i) = i.

Original entry on oeis.org

2, 4, 6, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 27, 28, 30, 32, 34, 36, 38, 40, 42, 44, 45, 46, 48, 50, 52, 54, 56, 58, 60, 62, 63, 64, 66, 68, 70, 72, 74, 75, 76, 78, 80, 81, 82, 84, 86, 88, 90, 92, 94, 96, 98, 99, 100, 102, 104, 106, 108, 110, 112, 114

Offset: 1

Gus Wiseman, Apr 06 2022

nonn

First differs from A118672 in having 75.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The terms together with their prime indices begin:
      2: {1}           28: {1,1,4}         56: {1,1,1,4}
      4: {1,1}         30: {1,2,3}         58: {1,10}
      6: {1,2}         32: {1,1,1,1,1}     60: {1,1,2,3}
      8: {1,1,1}       34: {1,7}           62: {1,11}
      9: {2,2}         36: {1,1,2,2}       63: {2,2,4}
     10: {1,3}         38: {1,8}           64: {1,1,1,1,1,1}
     12: {1,1,2}       40: {1,1,1,3}       66: {1,2,5}
     14: {1,4}         42: {1,2,4}         68: {1,1,7}
     16: {1,1,1,1}     44: {1,1,5}         70: {1,3,4}
     18: {1,2,2}       45: {2,2,3}         72: {1,1,1,2,2}
     20: {1,1,3}       46: {1,9}           74: {1,12}
     22: {1,5}         48: {1,1,1,1,2}     75: {2,3,3}
     24: {1,1,1,2}     50: {1,3,3}         76: {1,1,8}
     26: {1,6}         52: {1,1,6}         78: {1,2,6}
     27: {2,2,2}       54: {1,2,2,2}       80: {1,1,1,1,3}
For example, the multiset {2,3,3} with Heinz number 75 has a fixed point at position 3, so 75 is in the sequence.

* = unproved
These partitions are counted by A238395, strict A096765.
These are the nonzero positions in A352822.
*The complement reverse version is A352826, counted by A064428.
*The reverse version is A352827, counted by A001522 (strict A352829).
The complement is A352830, counted by A238394 (strict A025147).
A000700 counts self-conjugate partitions, ranked by A088902.
A001222 counts prime indices, distinct A001221.
A008290 counts permutations by fixed points, nonfixed A098825.
A056239 adds up prime indices, row sums of A112798 and A296150.
A114088 counts partitions by excedances.
A115720 and A115994 count partitions by their Durfee square.
A122111 represents partition conjugation using Heinz numbers.
A124010 gives prime signature, sorted A118914, conjugate rank A238745.
A238349 counts compositions by fixed points, complement A352523.
A238352 counts reversed partitions by fixed points.
A352833 counts partitions by fixed points.
Cf. A062457, A064410, A065770, A093641, A257990, A325187, A342192, A352486, A352823, A352824, A352825, A352831, A352832.

pq[y_]:=Length[Select[Range[Length[y]],#==y[[#]]&]];
Select[Range[100],pq[Flatten[Cases[FactorInteger[#],{p_,k_}:>Table[PrimePi[p],{k}]]]]>0&]

cp's OEIS Frontend

A335460 Number of (1,2,1) or (2,1,2)-matching permutations of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A336571 Number of sets of divisors d|n, 1 < d < n, all belonging to A130091 (numbers with distinct prime multiplicities) and forming a divisibility chain.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A352826 Heinz numbers of integer partitions y without a fixed point y(i) = i. Such a fixed point is unique if it exists.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A325508 Product of primes indexed by the prime exponents of n!.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A335462 Number of (1,2,1) and (2,1,2)-matching permutations of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A335463 Numbers k such that there exists a permutation of the prime indices of k matching both (1,2,1) and (2,1,2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A336423 Number of strict chains of divisors from n to 1 using terms of A130091 (numbers with distinct prime multiplicities).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica