A335451 -id:A335451 - cp's OEIS frontend

A335489 Number of strict permutations of the prime indices of n.

1, 1, 1, 0, 1, 2, 1, 0, 0, 2, 1, 0, 1, 2, 2, 0, 1, 0, 1, 0, 2, 2, 1, 0, 0, 2, 0, 0, 1, 6, 1, 0, 2, 2, 2, 0, 1, 2, 2, 0, 1, 6, 1, 0, 0, 2, 1, 0, 0, 0, 2, 0, 1, 0, 2, 0, 2, 2, 1, 0, 1, 2, 0, 0, 2, 6, 1, 0, 2, 6, 1, 0, 1, 2, 0, 0, 2, 6, 1, 0, 0, 2, 1, 0, 2, 2, 2

Offset: 1

Gus Wiseman, Jun 19 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.

Also the number of (1,1)-avoiding permutations of the prime indices of n.

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

Positions of first appearances are A002110 with 2 replaced by 4.
Permutations of prime indices are counted by A008480.
The contiguous version is A335451.
Anti-run permutations of prime indices are counted by A335452.
(1,1,1)-avoiding permutations of prime indices are counted by A335511.
Cf. A056239, A056986, A106356, A112798, A238279, A281188, A333221, A335456, A335460, A335462, A335465.

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

If n is squarefree, a(n) = A001221(n)!; otherwise a(n) = 0.

a(n != 4) = A281188(n); a(4) = 0.

A336107 Number of permutations of the prime indices of n with at least one non-singleton run, or non-separations.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 0, 0, 0, 1, 0, 2, 0, 2, 0, 0, 0, 4, 1, 0, 1, 2, 0, 0, 0, 1, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 2, 2, 0, 0, 5, 1, 2, 0, 2, 0, 4, 0, 4, 0, 0, 0, 6, 0, 0, 2, 1, 0, 0, 0, 2, 0, 0, 0, 9, 0, 0, 2, 2, 0, 0, 0, 5, 1, 0, 0, 6, 0, 0, 0

Offset: 1

Gus Wiseman, Sep 03 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.

A separation (or Carlitz composition) of a multiset is a permutation with no adjacent equal parts.

			The a(n) non-separations for n = 12, 36, 60, 72, 180, 420:
  (11)  (112)  (1122)  (1123)  (11122)  (11223)  (11234)
        (211)  (1221)  (1132)  (11212)  (11232)  (11243)
               (2112)  (2113)  (11221)  (11322)  (11324)
               (2211)  (2311)  (12112)  (12213)  (11342)
                       (3112)  (12211)  (12231)  (11423)
                       (3211)  (21112)  (13122)  (11432)
                               (21121)  (13221)  (21134)
                               (21211)  (21123)  (21143)
                               (22111)  (21132)  (23114)
                                        (22113)  (23411)
                                        (22131)  (24113)
                                        (22311)  (24311)
                                        (23112)  (31124)
                                        (23211)  (31142)
                                        (31122)  (32114)
                                        (31221)  (32411)
                                        (32112)  (34112)
                                        (32211)  (34211)
                                                 (41123)
                                                 (41132)
                                                 (42113)
                                                 (42311)
                                                 (43112)
                                                 (43211)

A005117 lists positions of zeros, with complement A013929.
A008480 counts permutations of prime indices, ranked by A333221.
A003242 and A335452 count separations, ranked by A333489.
A325535 counts inseparable partitions, ranked by A335448.
A325534 counts separable partitions, ranked by A335433.
Cf. A056239, A112798, A261962, A335451, A335452, A335460, A335489.

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

a(n) = A008480(n) - A335452(n).
a(A000961(n)) = 0 if n is in A027883, otherwise 1.
a(A005117(n)) = 0.
a(n!) = A335459(n).
a(A006939(n)) = A022915(n).

A335511 Number of (1,1,1)-avoiding permutations of the prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 0, 1, 2, 1, 3, 1, 2, 2, 0, 1, 3, 1, 3, 2, 2, 1, 0, 1, 2, 0, 3, 1, 6, 1, 0, 2, 2, 2, 6, 1, 2, 2, 0, 1, 6, 1, 3, 3, 2, 1, 0, 1, 3, 2, 3, 1, 0, 2, 0, 2, 2, 1, 12, 1, 2, 3, 0, 2, 6, 1, 3, 2, 6, 1, 0, 1, 2, 3, 3, 2, 6, 1, 0, 0, 2, 1, 12, 2, 2

Offset: 1

Gus Wiseman, Jun 19 2020

nonn

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

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

Patterns avoiding this pattern are counted by A080599.
These compositions are counted by A232432.
The (1,1)-avoiding version is A335451.
The complement A335510 is the matching version.
These permutations are ranked by A335513.
Patterns are counted by A000670 and ranked by A333217.
Permutations of prime indices are counted by A008480.
Anti-run permutations of prime indices are counted by A335452.
Cf. A056239, A056986, A112798, A238279, A281188, A333221, A333755, A335456, A335460, A335462, A335463.

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

If n is cubefree, a(n) = A008480(n), otherwise a(n) = 0.

A335508 Number of patterns of length n matching the pattern (1,1,1).

Original entry on oeis.org

0, 0, 0, 1, 9, 91, 993, 12013, 160275, 2347141, 37496163, 649660573, 12142311195, 243626199181, 5224710549243, 119294328993853, 2889836999693355, 74037381200415901, 2000383612949821323, 56850708386783835133, 1695491518035158123115, 52949018580275965241821

Offset: 0

Gus Wiseman, Jun 18 2020

nonn

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(3) = 1 through a(4) = 9 patterns:
  (1,1,1)  (1,1,1,1)
           (1,1,1,2)
           (1,1,2,1)
           (1,2,1,1)
           (1,2,2,2)
           (2,1,1,1)
           (2,1,2,2)
           (2,2,1,2)
           (2,2,2,1)

Alois P. Heinz, Table of n, a(n) for n = 0..424
Wikipedia, Permutation pattern
Gus Wiseman, Sequences counting and ranking compositions by the patterns they match or avoid.

The complement A080599 is the avoiding version.
Permutations of prime indices matching this pattern are counted by A335510.
Compositions matching this pattern are counted by A335455 and ranked by A335512.
Patterns are counted by A000670 and ranked by A333217.
Patterns matching the pattern (1,1) are counted by A019472.
Combinatory separations are counted by A269134.
Patterns matched by standard compositions are counted by A335454.
Minimal patterns avoided by a standard composition are counted by A335465.
Patterns matching (1,2,3) are counted by A335515.
Cf. A034691, A056986, A232464, A238279, A292884, A333175, A333755, A335451, A335456, A335457, A335458.
Cf. A276922.

b:= proc(n, k) option remember; `if`(n=0, 1, add(
      b(n-i, k)*binomial(n, i), i=1..min(n, k)))
    end:
a:= n-> b(n$2)-b(n, 2):
seq(a(n), n=0..21);  # Alois P. Heinz, Jan 28 2024

allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]];
Table[Length[Select[Join@@Permutations/@allnorm[n],MatchQ[#,{_,x_,_,x_,_,x_,_}]&]],{n,0,6}]

a(n) = Sum_{k=3..n} A276922(n,k). - Alois P. Heinz, Jan 28 2024

a(n) = A000670(n) - A080599(n). - Andrew Howroyd, Jan 28 2024

a(9)-a(21) from Alois P. Heinz, Jan 28 2024

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

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 1, 0, 0, 2, 0, 2, 1, 1, 0, 3, 0, 1, 0, 2, 0, 5, 0, 0, 1, 1, 1, 5, 0, 1, 1, 3, 0, 5, 0, 2, 2, 1, 0, 4, 0, 2, 1, 2, 0, 3, 1, 3, 1, 1, 0, 11, 0, 1, 2, 0, 1, 5, 0, 2, 1, 5, 0, 9, 0, 1, 2, 2, 1, 5, 0, 4, 0, 1, 0, 11, 1, 1

Offset: 1

Gus Wiseman, Jun 14 2020

nonn

Depends only on sorted prime signature (A118914).
Also the number of (2,1)-matching permutations of the prime indices of n.
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. 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 = 6, 12, 24, 48, 30, 72, 60:
  (12)  (112)  (1112)  (11112)  (123)  (11122)  (1123)
        (121)  (1121)  (11121)  (132)  (11212)  (1132)
               (1211)  (11211)  (213)  (11221)  (1213)
                       (12111)  (231)  (12112)  (1231)
                                (312)  (12121)  (1312)
                                       (12211)  (1321)
                                       (21112)  (2113)
                                       (21121)  (2131)
                                       (21211)  (2311)
                                                (3112)
                                                (3121)

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

The avoiding version is A000012.
Patterns are counted by A000670.
Positions of zeros are A000961.
(1,2)-matching patterns are counted by A002051.
Permutations of prime indices are counted by A008480.
(1,2)-matching compositions are counted by A056823.
STC-numbers of permutations of prime indices are A333221.
Patterns matched by standard compositions are counted by A335454.
(1,2,1) or (2,1,2)-matching permutations of prime indices are A335460.
(1,2,1) and (2,1,2)-matching permutations of prime indices are A335462.
Dimensions of downsets of standard compositions are A335465.
(1,2)-matching compositions are ranked by A335485.
Cf. A056239, A056986, A112798, A181796, A333175, A335451, A335452, A335463, A333175.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Permutations[primeMS[n]],!GreaterEqual@@#&]],{n,100}]

a(n) = A008480(n) - 1.

A335487 Number of (1,1)-matching permutations of the prime indices of n.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 3, 0, 0, 0, 1, 0, 3, 0, 3, 0, 0, 0, 4, 1, 0, 1, 3, 0, 0, 0, 1, 0, 0, 0, 6, 0, 0, 0, 4, 0, 0, 0, 3, 3, 0, 0, 5, 1, 3, 0, 3, 0, 4, 0, 4, 0, 0, 0, 12, 0, 0, 3, 1, 0, 0, 0, 3, 0, 0, 0, 10, 0, 0, 3, 3, 0, 0, 0, 5, 1, 0, 0, 12, 0, 0

Offset: 1

Gus Wiseman, Jun 14 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. 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 = 4, 12, 24, 48, 36, 72, 60:
  (11)  (112)  (1112)  (11112)  (1122)  (11122)  (1123)
        (121)  (1121)  (11121)  (1212)  (11212)  (1132)
        (211)  (1211)  (11211)  (1221)  (11221)  (1213)
               (2111)  (12111)  (2112)  (12112)  (1231)
                       (21111)  (2121)  (12121)  (1312)
                                (2211)  (12211)  (1321)
                                        (21112)  (2113)
                                        (21121)  (2131)
                                        (21211)  (2311)
                                        (22111)  (3112)
                                                 (3121)
                                                 (3211)

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

Positions of zeros are A005117 (squarefree numbers).
The case where the match must be contiguous is A333175.
The avoiding version is A335489.
The (1,1,1)-matching case is A335510.
Patterns are counted by A000670.
Permutations of prime indices are counted by A008480.
(1,1)-matching patterns are counted by A019472.
(1,1)-matching compositions are counted by A261982.
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.
(1,1)-matching compositions are ranked by A335488.
Cf. A000961, A056239, A056986, A112798, A181796, A335451, A335452, A335460, A335462.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Permutations[primeMS[n]],!UnsameQ@@#&]],{n,100}]

a(n) = 0 if n is squarefree, otherwise a(n) = A008480(n).

a(n) = A008480(n) - A281188(n) for n != 4.

cp's OEIS Frontend

A335489 Number of strict permutations of the prime indices of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A336107 Number of permutations of the prime indices of n with at least one non-singleton run, or non-separations.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A335511 Number of (1,1,1)-avoiding permutations of the prime indices of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A335508 Number of patterns of length n matching the pattern (1,1,1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A335487 Number of (1,1)-matching permutations of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula