A281116 -id:A281116 - cp's OEIS frontend

A319239 Positions of nonzero terms in A316441, the list of coefficients in the expansion of Product_{n > 1} 1/(1 + 1/n^s).

1, 2, 3, 5, 7, 8, 11, 13, 16, 17, 19, 23, 24, 27, 29, 30, 31, 32, 36, 37, 40, 41, 42, 43, 47, 53, 54, 56, 59, 60, 61, 64, 66, 67, 70, 71, 73, 78, 79, 81, 83, 84, 88, 89, 90, 96, 97, 100, 101, 102, 103, 104, 105, 107, 109, 110, 113, 114, 120, 125, 126, 127, 128

Offset: 1

Gus Wiseman, Sep 15 2018

nonn

Complement of A319240.

Cf. A001055, A045778, A114592, A162247, A190938, A281116, A281118, A303386, A316441, A319237.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Join@@Position[Table[Sum[(-1)^Length[f],{f,facs[n]}],{n,100}],_Integer?(Abs[#]>0&)]

A319751 Number of non-isomorphic set systems of weight n with empty intersection.

Original entry on oeis.org

1, 0, 1, 2, 6, 13, 35, 83, 217, 556, 1504, 4103, 11715, 34137, 103155, 320217, 1025757, 3376889, 11436712, 39758152, 141817521, 518322115, 1939518461, 7422543892, 29028055198, 115908161428, 472185530376, 1961087909565, 8298093611774, 35750704171225, 156734314212418

Offset: 0

Gus Wiseman, Sep 27 2018

nonn

A set system is a finite set of finite nonempty sets. Its weight is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(2) = 1 through a(5) = 13 set systems:
2: {{1},{2}}
3: {{1},{2,3}}
   {{1},{2},{3}}
4: {{1},{2,3,4}}
   {{1,2},{3,4}}
   {{1},{2},{1,2}}
   {{1},{2},{3,4}}
   {{1},{3},{2,3}}
   {{1},{2},{3},{4}}
5: {{1},{2,3,4,5}}
   {{1,2},{3,4,5}}
   {{1},{2},{3,4,5}}
   {{1},{4},{2,3,4}}
   {{1},{2,3},{4,5}}
   {{1},{2,4},{3,4}}
   {{2},{3},{1,2,3}}
   {{2},{1,3},{2,3}}
   {{4},{1,2},{3,4}}
   {{1},{2},{3},{2,3}}
   {{1},{2},{3},{4,5}}
   {{1},{2},{4},{3,4}}
   {{1},{2},{3},{4},{5}}

Andrew Howroyd, Table of n, a(n) for n = 0..50

Cf. A007716, A049311, A281116, A283877, A316980, A317752, A317755, A317757, A319616.

Cf. A319077, A319748, A319755, A319778, A319781, A319791.

WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, (-1)^(n-1)/n))))-1, -#v)}
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(q, t, k)={WeighT(Vec(sum(j=1, #q, gcd(t, q[j])*x^lcm(t, q[j])) + O(x*x^k), -k))}
R(q, n)={vector(n, t, x*Ser(K(q, t, n)/t))}
a(n)={if(n==0, 1, my(s=0); forpart(q=n, my(u=R(q,n)); s+=permcount(q)*polcoef(exp(sum(t=1, n, u[t]-subst(u[t],x,x^2), O(x*x^n))) - exp(sum(t=1, n\2, x^t*u[t] - subst(x^t*u[t],x,x^2), O(x*x^n)))*(1+x), n)); s/n!)} \\ Andrew Howroyd, May 30 2023

Terms a(11) and beyond from Andrew Howroyd, May 30 2023

A327400 Number of factorizations of n that are constant or whose factors are relatively prime.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 2, 3, 1, 5, 1, 2, 2, 2, 2, 7, 1, 2, 2, 4, 1, 5, 1, 3, 3, 2, 1, 6, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 9, 1, 2, 3, 4, 2, 5, 1, 3, 2, 5, 1, 10, 1, 2, 3, 3, 2, 5, 1, 6, 3, 2, 1, 9, 2, 2, 2

Offset: 1

Gus Wiseman, Sep 22 2019

nonn

First differs from A327399 at a(24) = 4, A327399(24) = 3.

			The factorizations of 2, 4, 12, 24, 30, 36, 48, and 60 that are constant or whose factors are relatively prime:
  2   4     12      24        30      36        48          60
      2*2   3*4     3*8       5*6     4*9       3*16        3*20
            2*2*3   2*3*4     2*15    6*6       2*3*8       4*15
                    2*2*2*3   3*10    2*2*9     3*4*4       5*12
                              2*3*5   2*3*6     2*2*3*4     2*5*6
                                      3*3*4     2*2*2*2*3   3*4*5
                                      2*2*3*3               2*2*15
                                                            2*3*10
                                                            2*2*3*5

Constant factorizations are A089723.

Cf. A007359, A051424, A281116, A302569, A304709, A304711, A319269, A327399.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],#=={}||Length[Union[#]]==1||GCD@@#==1&]],{n,100}]

a(n) = A281116(n) + A089723(n).

A327405 Quotient of n over the maximum divisor of n that is 1 or whose prime indices have a common divisor > 1.

Original entry on oeis.org

1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 3, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 6, 1, 32, 3, 2, 5, 4, 1, 2, 1, 8, 1, 2, 1, 4, 5, 2, 1, 16, 1, 2, 3, 4, 1, 2, 5, 8, 1, 2, 1, 12, 1, 2, 1, 64, 1, 6, 1, 4, 3, 10, 1, 8, 1, 2, 3, 4, 7, 2, 1, 16, 1, 2, 1, 4, 5

Offset: 1

Gus Wiseman, Sep 21 2019

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. Numbers whose prime indices have a common divisor > 1 are listed in A318978.

			The divisors of 90 that are 1 or whose prime indices have a common divisor > 1 are {1, 3, 5, 9}, so a(90) = 90/9 = 10.

Antti Karttunen, Table of n, a(n) for n = 1..20000
Gus Wiseman, Sequences counting and encoding certain classes of multisets
Index entries for sequences computed from indices in prime factorization

See link for additional cross-references.

Cf. A000005, A056239, A112798, A281116, A289509, A302569.

Table[n/Max[Select[Divisors[n],GCD@@PrimePi/@First/@FactorInteger[#]!=1&]],{n,100}]

A327405(n) = (n / vecmax(select(d -> (1==d)||(gcd(apply(primepi,factor(d)[, 1]~))>1), divisors(n)))); \\ Antti Karttunen, Dec 06 2021

a(n) = n/A327656(n).

A327529 Maximum divisor of n that is 1 or whose prime indices are relatively prime.

Original entry on oeis.org

1, 2, 1, 4, 1, 6, 1, 8, 1, 10, 1, 12, 1, 14, 15, 16, 1, 18, 1, 20, 1, 22, 1, 24, 1, 26, 1, 28, 1, 30, 1, 32, 33, 34, 35, 36, 1, 38, 1, 40, 1, 42, 1, 44, 45, 46, 1, 48, 1, 50, 51, 52, 1, 54, 55, 56, 1, 58, 1, 60, 1, 62, 1, 64, 1, 66, 1, 68, 69, 70, 1, 72, 1, 74

Offset: 1

Gus Wiseman, Sep 17 2019

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. Numbers whose prime indices are relatively prime are A289509. The number of divisors of n that are 1 or whose prime indices are relatively prime is A327530(n).

Robert Israel, Table of n, a(n) for n = 1..10000
Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A000005, A112798, A281116, A289509, A318721.

g:= proc(n)  uses numtheory; igcd(op(map(pi,factorset(n))))=1 end proc:
seq(`if`(g(n),n,1), n=1..100); # Robert Israel, Sep 19 2019

Table[Max[Select[Divisors[n],#==1||GCD@@PrimePi/@First/@FactorInteger[#]==1&]],{n,100}]

a(n) = n if n is in A289509, otherwise a(n) = 1.

A327535 Maximum divisor of n that is 1, prime, or whose prime indices are relatively prime.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 3, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 7, 22, 23, 24, 5, 26, 3, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 13, 40, 41, 42, 43, 44, 45, 46, 47, 48, 7, 50, 51, 52, 53, 54, 55, 56, 19, 58, 59, 60, 61, 62, 7, 64, 13, 66, 67, 68, 69

Offset: 1

Gus Wiseman, Sep 17 2019

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. Numbers that are 1, prime, or whose prime indices are relatively prime are A327534. The number of divisors of n satisfying the same conditions is A327536(n).

			The divisors of 63 that are 1, prime, or whose prime indices are relatively prime are {1, 3, 7}, so a(63) = 7.

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A000005, A000961, A006530, A056239, A112798, A281116, A289509, A327407.

Table[Max@@Select[Divisors[n],#==1||PrimeQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1&],{n,100}]

If n is in A327534, then a(n) = n; otherwise a(n) = A006530(n).

A327536 Number of divisors of n that are 1, prime, or whose prime indices are relatively prime.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 4, 2, 4, 2, 6, 2, 4, 4, 5, 2, 5, 2, 6, 3, 4, 2, 8, 2, 4, 2, 6, 2, 8, 2, 6, 4, 4, 4, 8, 2, 4, 3, 8, 2, 7, 2, 6, 5, 4, 2, 10, 2, 5, 4, 6, 2, 6, 4, 8, 3, 4, 2, 12, 2, 4, 3, 7, 3, 8, 2, 6, 4, 8, 2, 11, 2, 4, 5, 6, 4, 7, 2, 10, 2, 4, 2, 11, 4

Offset: 1

Gus Wiseman, Sep 17 2019

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. Numbers that are 1, prime, or whose prime indices are relatively prime are A327534. The maximum divisor of n satisfying the same conditions is A327535(n).

			The divisors of 63 that are 1, prime, or whose prime indices are relatively prime are {1, 3, 7}, so a(63) = 3.

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A000005, A056239, A112798, A281116, A289509, A327407.

Table[Length[Select[Divisors[n],#==1||PrimeQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1&]],{n,100}]

A327657 Number of divisors of n that are 1 or whose prime indices have a common divisor > 1.

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 1, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 4, 2, 2, 3, 2, 1, 3, 2, 3, 3, 2, 2, 4, 2, 2, 4, 2, 2, 4, 2, 2, 2, 3, 3, 3, 2, 2, 4, 3, 2, 4, 2, 2, 3, 2, 2, 6, 1, 4, 3, 2, 2, 3, 3, 2, 3, 2, 2, 4, 2, 3, 4, 2, 2, 5, 2, 2, 4, 3, 2, 4, 2, 2, 4, 4, 2, 3, 2, 3, 2, 2, 3, 4, 3, 2, 3, 2, 2, 5

Offset: 1

Gus Wiseman, Sep 21 2019

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. Numbers whose prime indices have a common divisor > 1 are listed in A318978.

			The divisors of 90 that are 1 or whose prime indices have a common divisor > 1 are {1, 3, 5, 9}, so a(90) = 4.

Antti Karttunen, Table of n, a(n) for n = 1..20000
Gus Wiseman, Sequences counting and encoding certain classes of multisets
Index entries for sequences computed from indices in prime factorization

See link for additional cross-references.

Cf. A000005, A056239, A112798, A281116, A289509, A318979, A327406, A327656.

Table[Length[Select[Divisors[n],GCD@@PrimePi/@First/@FactorInteger[#]!=1&]],{n,100}]

A327657(n) = sumdiv(n, d, (1==d)||(gcd(apply(x->primepi(x), factor(d)[, 1]))>1)); \\ Antti Karttunen, Dec 05 2021

a(n) = A000005(n) - A318979(n). - Antti Karttunen, Dec 05 2021

Data section extended up to 105 terms by Antti Karttunen, Dec 05 2021

A327658 Number of factorizations of n that are empty or whose factors have a common divisor > 1.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 5, 1, 2, 1, 2, 1, 1, 1, 4, 2, 1, 3, 2, 1, 1, 1, 7, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 2, 2, 1, 1, 7, 2, 2, 1, 2, 1, 4, 1, 4, 1, 1, 1, 3, 1, 1, 2, 11, 1, 1, 1, 2, 1, 1, 1, 7, 1, 1, 2, 2, 1, 1, 1, 7, 5, 1, 1, 3, 1, 1, 1

Offset: 1

Gus Wiseman, Sep 21 2019

nonn

First differs from A319786 at a(900) = 11, A319786(900) = 12.

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. Numbers whose prime indices have a common divisor > 1 are listed in A318978.

			The a(120) = 7 factorizations:
  (120)
  (2*60)
  (4*30)
  (6*20)
  (10*12)
  (2*2*30)
  (2*6*10)

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A000005, A056239, A112798, A281116, A289509, A327406.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],#=={}||GCD@@#!=1&]],{n,100}]

A304649 Number of divisors d|n such that neither d nor n/d is a perfect power greater than 1.

Original entry on oeis.org

1, 2, 2, 1, 2, 4, 2, 0, 1, 4, 2, 4, 2, 4, 4, 0, 2, 4, 2, 4, 4, 4, 2, 4, 1, 4, 0, 4, 2, 8, 2, 0, 4, 4, 4, 5, 2, 4, 4, 4, 2, 8, 2, 4, 4, 4, 2, 4, 1, 4, 4, 4, 2, 4, 4, 4, 4, 4, 2, 10, 2, 4, 4, 0, 4, 8, 2, 4, 4, 8, 2, 6, 2, 4, 4, 4, 4, 8, 2, 4, 0, 4, 2, 10, 4, 4, 4, 4

Offset: 1

Gus Wiseman, May 15 2018

nonn

			The a(36) = 5 ways to write 36 as a product of two numbers that are not perfect powers greater than 1 are 2*18, 3*12, 6*6, 12*3, 18*2.

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

Cf. A000005, A001055, A007427, A007916, A034444, A045778, A162247, A183096, A281116, A301700, A303386, A303707, A304650.

nn=1000;
sradQ[n_]:=GCD@@FactorInteger[n][[All,2]]===1;
Table[Length@Select[Divisors[n],sradQ[n/#]&&sradQ[#]&],{n,nn}]

a(n) = sumdiv(n, d, !ispower(d) && !ispower(n/d)); \\ Michel Marcus, May 17 2018

cp's OEIS Frontend

A319239 Positions of nonzero terms in A316441, the list of coefficients in the expansion of Product_{n > 1} 1/(1 + 1/n^s).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

A319751 Number of non-isomorphic set systems of weight n with empty intersection.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A327400 Number of factorizations of n that are constant or whose factors are relatively prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A327405 Quotient of n over the maximum divisor of n that is 1 or whose prime indices have a common divisor > 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A327529 Maximum divisor of n that is 1 or whose prime indices are relatively prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A327535 Maximum divisor of n that is 1, prime, or whose prime indices are relatively prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A327536 Number of divisors of n that are 1, prime, or whose prime indices are relatively prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A327657 Number of divisors of n that are 1 or whose prime indices have a common divisor > 1.

Views

Author

Keywords

Comments

Examples

Links