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.

A048166 Numbers k that are divisible by the number of unitary divisors of k (A034444).

Original entry on oeis.org

1, 2, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 64, 68, 72, 76, 80, 88, 92, 96, 100, 104, 108, 112, 116, 120, 124, 128, 136, 144, 148, 152, 160, 164, 168, 172, 176, 184, 188, 192, 196, 200, 208, 212, 216, 224, 232, 236, 240, 244, 248, 256, 264, 268
Offset: 1

Views

Author

Keywords

Examples

			a(81) = 392 = 2^3*7^2 has 4 unitary divisors, {1, 392, 8, 49}, and 4 divides 392.
		

Crossrefs

Programs

  • Mathematica
    okQ[n_] := Divisible[n, DivisorSum[n, Boole[CoprimeQ[#, n/#]]&]]; Select[ Range[300], okQ] (* Jean-François Alcover, Dec 05 2015 *)
    Select[Range[270], Divisible[#, 2^PrimeNu[#]] &] (* Amiram Eldar, Jul 16 2019 *)
  • PARI
    isok(n) = !(n % sumdiv(n, d, gcd(d, n/d)==1)); \\ Michel Marcus, Feb 25 2014
    
  • PARI
    isok(n) = !(n % 2^omega(n)); \\ Amiram Eldar, Jul 16 2019

Formula

Binomial transform of [1, 1, 1, 1, -3, 5, -7, 9, -11, 13, ...]. Binomial transform of this sequence is A048481. - Gary W. Adamson, Oct 23 2007