A335452 -id:A335452 - cp's OEIS frontend

A355817 Dirichlet inverse of A010055, characteristic function of powers of primes.

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

Offset: 1

Antti Karttunen, Jul 19 2022

sign

Question: Are the absolute values of this sequence given by A335452? Compare also to A355939 and A008480.

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

Cf. A010055, A335452.

Cf. also A050363, A355827, A355939.

s[n_] := If[PrimeNu[n] < 2, 1, 0]; a[1] = 1; a[n_] := a[n] = -DivisorSum[n, s[n/#]*a[#] &, # < n &]; Array[a, 100] (* Amiram Eldar, Jul 19 2022 *)

A010055(n) = ((1==n)||isprimepower(n));
memoA355817 = Map();
A355817(n) = if(1==n,1,my(v); if(mapisdefined(memoA355817,n,&v), v, v = -sumdiv(n,d,if(dA010055(n/d)*A355817(d),0)); mapput(memoA355817,n,v); (v)));

a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, dA010055(n/d) * a(d).

A355939 Dirichlet inverse of A080339, characteristic function of noncomposite numbers.

Original entry on oeis.org

1, -1, -1, 1, -1, 2, -1, -1, 1, 2, -1, -3, -1, 2, 2, 1, -1, -3, -1, -3, 2, 2, -1, 4, 1, 2, -1, -3, -1, -6, -1, -1, 2, 2, 2, 6, -1, 2, 2, 4, -1, -6, -1, -3, -3, 2, -1, -5, 1, -3, 2, -3, -1, 4, 2, 4, 2, 2, -1, 12, -1, 2, -3, 1, 2, -6, -1, -3, 2, -6, -1, -10, -1, 2, -3, -3, 2, -6, -1, -5, 1, 2, -1, 12, 2, 2, 2, 4, -1, 12, 2, -3, 2, 2, 2, 6, -1, -3, -3, 6, -1, -6, -1, 4, -6

Offset: 1

Antti Karttunen, Jul 21 2022

sign

The absolute values of this sequence are given by A008480. Compare also to A355817 and A335452.

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

Cf. A008480, A010051, A080339.

Cf. also A346482, A355817, A355827.

s[n_] := If[CompositeQ[n], 0, 1]; a[1] = 1; a[n_] := a[n] = -DivisorSum[n, s[n/#]*a[#] &, # < n &]; Array[a, 100] (* Amiram Eldar, Jul 21 2022 *)

memoA355939 = Map();
A355939(n) = if(1==n,1,my(v); if(mapisdefined(memoA355939,n,&v), v, v = -sumdiv(n,d,if(dA355939(d),0)); mapput(memoA355939,n,v); (v)));

a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, dA010051(n/d) * a(d).

Dirichlet g.f.: 1/(1 + B(s)), where B(s) is d.g.f. of characteristic function of primes. - Vaclav Kotesovec, Jul 22 2022

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.

A336104 Number of permutations of the prime indices of A000225(n) = 2^n - 1 with at least one non-singleton run.

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 96, 0, 120, 6, 0, 0, 720, 0, 0, 0, 0, 0, 720, 0, 0, 0, 0, 0, 322560, 0, 0, 0, 5040, 0, 4320, 0, 0, 0, 0, 0, 362880, 0, 0

Offset: 1

Gus Wiseman, Sep 03 2020

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 a(21) = 6 permutations of {4, 4, 31, 68}:
  (4,4,31,68)
  (4,4,68,31)
  (31,4,4,68)
  (31,68,4,4)
  (68,4,4,31)
  (68,31,4,4)

A335432 is the anti-run version.
A335459 is the version for factorial numbers.
A336105 counts all permutations of this multiset.
A336107 is not restricted to predecessors of powers of 2.
A003242 counts anti-run compositions.
A005649 counts anti-run patterns.
A008480 counts permutations of prime indices.
A325534 counts separable partitions, ranked by A335433.
A325535 counts inseparable partitions, ranked by A335448.
A333489 ranks anti-run compositions.
A335433 lists numbers whose prime indices have an anti-run permutation.
A335448 lists numbers whose prime indices have no anti-run permutation.
A335452 counts anti-run permutations of prime indices.
A335489 counts strict permutations of prime indices.
Cf. A056239, A106351, A112798, A114938, A292884, A336102.
The numbers 2^n - 1: A000225, A001265, A001348, A046051, A046800, A046801, A049093, A325610, A325611, A325612, A325625.

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

a(n) = A336107(2^n - 1).

a(n) = A336105(n) - A335432(n).

A350353 Numbers whose multiset of prime factors has a permutation that is not weakly alternating.

Original entry on oeis.org

30, 36, 42, 60, 66, 70, 72, 78, 84, 90, 100, 102, 105, 108, 110, 114, 120, 126, 130, 132, 138, 140, 144, 150, 154, 156, 165, 168, 170, 174, 180, 182, 186, 190, 195, 196, 198, 200, 204, 210, 216, 220, 222, 225, 228, 230, 231, 234, 238, 240, 246, 252, 255, 258

Offset: 1

Gus Wiseman, Jan 13 2022

nonn

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either.

			The terms together with a (generally not unique) non-weakly alternating permutation of each multiset of prime indices begin:
   30 : (1,2,3)       100 : (1,3,3,1)
   36 : (1,2,2,1)     102 : (1,2,7)
   42 : (1,2,4)       105 : (2,3,4)
   60 : (1,1,2,3)     108 : (1,2,2,1,2)
   66 : (1,2,5)       110 : (1,3,5)
   70 : (1,3,4)       114 : (1,2,8)
   72 : (1,1,2,2,1)   120 : (1,1,1,2,3)
   78 : (1,2,6)       126 : (1,2,4,2)
   84 : (1,1,2,4)     130 : (1,3,6)
   90 : (1,2,3,2)     132 : (1,1,2,5)

The strong version is A289553, complement A167171.
These are the positions of nonzero terms in A349797.
Below, WA = "weakly alternating":
- WA compositions are counted by A349052/A129852/A129853.
- Non-WA compositions are counted by A349053, ranked by A349057.
- WA permutations of prime factors = A349056, complement A349797.
- WA patterns are counted by A349058, complement A350138.
- WA ordered factorizations are counted by A349059, complement A350139.
- WA partitions are counted by A349060, complement A349061.
A001250 counts alternating permutations, complement A348615.
A008480 counts permutations of prime factors.
A025047 = alternating compositions, ranked by A345167, complement A345192.
A056239 adds up prime indices, row sums of A112798 (row lengths A001222).
A071321 gives the alternating sum of prime factors, reverse A071322.
A335452 counts anti-run permutations of prime factors, complement A336107.
A345164 = alternating permutations of prime factors, complement A350251.
Cf. A003242, A335433, A335448, A344652, A344653, A345171, A345172, A345173, A348379, A348613, A349798, A350252, A349800.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
whkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}];
Select[Range[100],Select[Permutations[primeMS[#]],!whkQ[#]&&!whkQ[-#]&]!={}&]

cp's OEIS Frontend

A355817 Dirichlet inverse of A010055, characteristic function of powers of primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A355939 Dirichlet inverse of A080339, characteristic function of noncomposite numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A336104 Number of permutations of the prime indices of A000225(n) = 2^n - 1 with at least one non-singleton run.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A350353 Numbers whose multiset of prime factors has a permutation that is not weakly alternating.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica