cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-23 of 23 results.

A320439 Number of factorizations of n into factors > 1 where each factor's prime indices are relatively prime. Number of factorizations of n using elements of A289509.

Original entry on oeis.org

1, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 1, 5, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 2, 0, 7, 1, 1, 1, 3, 0, 1, 0, 4, 0, 1, 0, 2, 1, 1, 0, 7, 0, 1, 1, 2, 0, 1, 1, 4, 0, 1, 0, 5, 0, 1, 0, 11, 0, 2, 0, 2, 1, 2, 0, 6, 0, 1, 1, 2, 1, 1, 0, 7, 0, 1, 0, 3, 1, 1, 0
Offset: 1

Views

Author

Gus Wiseman, Jan 08 2019

Keywords

Comments

Also the number of multiset partitions of the multiset of prime indices of n using multisets each of which is relatively prime.
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.
Two or more numbers are relatively prime if they have no common divisor > 1. A single number is not considered to be relatively prime unless it is equal to 1.

Examples

			The a(72) = 6 factorizations are (2*2*18), (2*6*6), (2*36), (4*18), (6*12), (72).
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    facsrp[n_]:=If[n<=1,{{}},Join@@Table[(Prepend[#,d]&)/@Select[facsrp[n/d],Min@@#>=d&],{d,Select[Rest[Divisors[n]],GCD@@primeMS[#]==1&]}]];
    Table[Length[facsrp[n]],{n,100}]
  • PARI
    A320439(n, m=n) = if(1==n, 1, my(s=0); fordiv(n, d, if((d<=m)&&(1==gcd(apply(x->primepi(x), factor(d)[, 1]))), s += A320439(n/d, d))); (s)); \\ Antti Karttunen, Dec 06 2021

A143446 Triangle read by rows: A000012 * A143424.

Original entry on oeis.org

1, 0, 2, -1, 2, 4, -1, 0, 4, 8, -2, 0, 4, 8, 16, -1, -2, 0, 8, 16, 32, -2, -2, 0, 8, 16, 32, 64, -2, -2, 0, 0, 16, 32, 64, 128, -2, -2, -4, 0, 16, 32, 64, 128, 256, -1, -4, -4, 0, 0, 32, 64, 128, 256, 512, -2, -4, -4, 0, 0, 32, 64, 128, 256, 512, 1024, -2, -2, -4, -8, 0, 0, 64, 128, 256, 512, 1024, 2048
Offset: 1

Views

Author

Gary W. Adamson, Aug 15 2008

Keywords

Comments

Row sums = A085945: (1, 2, 5, 11, 26, 53, 116, ...).

Examples

			First few rows of the triangle:
   1;
   0,  2;
  -1,  2,  4;
  -1,  0,  4,  8;
  -2,  0,  4,  8, 16;
  -1, -2,  0,  8, 16, 32;
  -2, -2,  0,  8, 16, 32, 64;
  ...
		

Crossrefs

Extensions

a(37) = -2 corrected and more terms from Georg Fischer, Jun 05 2023

A319187 Number of pairwise coprime subsets of {1,...,n} of maximum cardinality (A036234).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 2, 3, 6, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 8, 8, 8, 16, 16, 24, 24, 24, 24, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 72, 72, 72, 72, 72, 72, 72, 72
Offset: 1

Views

Author

Gus Wiseman, Jan 09 2019

Keywords

Comments

Two or more numbers are pairwise coprime if no pair of them has a common divisor > 1. A single number is not considered to be pairwise coprime unless it is equal to 1.

Examples

			The a(8) = 3 subsets are {1,2,3,5,7}, {1,3,4,5,7}, {1,3,5,7,8}.
		

Crossrefs

Rightmost terms of A186974 and A320436.
Run lengths are A053707.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Range[n],{PrimePi[n]+1}],CoprimeQ@@#&]],{n,24}] (* see A186974 for a faster program *)
  • PARI
    a(n) = prod(p=1, n, if (isprime(p), logint(n, p), 1)); \\ Michel Marcus, Dec 26 2020

Formula

a(n) = Product_{p prime <= n} floor(log_p(n)).
a(n) = A000005(A045948(n)). - Ridouane Oudra, Sep 02 2019
Previous Showing 21-23 of 23 results.