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.

Showing 1-2 of 2 results.

A048751 Composites k whose product of divisors divided by number of divisors is an integer.

Original entry on oeis.org

6, 8, 9, 10, 12, 14, 18, 22, 24, 26, 30, 34, 36, 38, 40, 42, 46, 54, 56, 58, 60, 62, 66, 70, 72, 74, 78, 80, 82, 84, 86, 88, 90, 94, 96, 102, 104, 106, 108, 110, 114, 118, 120, 122, 126, 128, 130, 132, 134, 136, 138, 142, 146, 150, 152, 154, 156, 158, 166, 168, 170
Offset: 1

Views

Author

Enoch Haga, Dec 11 1999

Keywords

Comments

Sequence is identical to A120736 except that it does not include terms 1 and 2, which are not composite. Michel Marcus, Jun 06 2014

Examples

			For k=8, product of divisors is 8*4*2*1=64; number of divisors = 4; 64/4 = 16 (an integer), so 8 is a term.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[200],CompositeQ[#]&&IntegerQ[(Times@@Divisors[#])/ DivisorSigma[ 0,#]]&] (* Harvey P. Dale, Aug 21 2021 *)
  • PARI
    isok(n) = (n!=1) && ! isprime(n) && (d = divisors(n)) && ((prod(i=1, #d, d[i]) % numdiv(n)) == 0); \\ Michel Marcus, Jun 05 2014
    
  • PARI
    is(n)=my(f=factor(n)); n>5 && !isprime(n) && if(gcd(f[,2])%2, n^(numdiv(f)/2), sqrtint(n)^numdiv(f))%numdiv(f)==0 \\ Charles R Greathouse IV, Jun 06 2014

Extensions

Corrected by Michel Marcus, Jun 05 2014

A048753 Composite numbers k whose product of aliquot divisors divided by number of aliquot divisors is an integer.

Original entry on oeis.org

4, 6, 15, 16, 20, 21, 27, 33, 36, 39, 42, 45, 48, 50, 51, 56, 57, 69, 70, 75, 87, 93, 100, 105, 111, 120, 123, 129, 132, 141, 154, 159, 162, 175, 177, 182, 183, 189, 196, 198, 201, 210, 213, 219, 220, 231, 237, 238, 245, 249, 256, 266, 267, 270, 273, 275, 291
Offset: 1

Views

Author

Keywords

Examples

			For k=6, the product of aliquot divisors is 3*2*1=6; the number of aliquot divisors is 3; 6/3 = 2 (an integer), so 6 is a term.
		

Crossrefs

Programs

  • Mathematica
    padQ[n_]:=Module[{ad=Most[Divisors[n]]},!PrimeQ[n]&&Divisible[Times@@ad, Length[ad]]]; Select[Range[2,300],padQ] (* Harvey P. Dale, May 07 2012 *)
Showing 1-2 of 2 results.