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.
%I A048166 #29 Jul 16 2019 12:11:43
%S A048166 1,2,4,8,12,16,20,24,28,32,36,40,44,48,52,56,64,68,72,76,80,88,92,96,
%T A048166 100,104,108,112,116,120,124,128,136,144,148,152,160,164,168,172,176,
%U A048166 184,188,192,196,200,208,212,216,224,232,236,240,244,248,256,264,268
%N A048166 Numbers k that are divisible by the number of unitary divisors of k (A034444).
%H A048166 Amiram Eldar, <a href="/A048166/b048166.txt">Table of n, a(n) for n = 1..10000</a> (terms n = 1..5000 from G. C. Greubel)
%F A048166 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
%e A048166 a(81) = 392 = 2^3*7^2 has 4 unitary divisors, {1, 392, 8, 49}, and 4 divides 392.
%t A048166 okQ[n_] := Divisible[n, DivisorSum[n, Boole[CoprimeQ[#, n/#]]&]]; Select[ Range[300], okQ] (* _Jean-François Alcover_, Dec 05 2015 *)
%t A048166 Select[Range[270], Divisible[#, 2^PrimeNu[#]] &] (* _Amiram Eldar_, Jul 16 2019 *)
%o A048166 (PARI) isok(n) = !(n % sumdiv(n, d, gcd(d, n/d)==1)); \\ _Michel Marcus_, Feb 25 2014
%o A048166 (PARI) isok(n) = !(n % 2^omega(n)); \\ _Amiram Eldar_, Jul 16 2019
%Y A048166 Cf. A033950, A034444, A000005, A048167, A048481.
%K A048166 nonn
%O A048166 1,2
%A A048166 _Labos Elemer_