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 A073182 #15 Jul 18 2017 11:43:24
%S A073182 1,2,2,3,2,4,2,3,3,4,2,6,2,4,4,3,2,6,2,6,4,4,2,7,3,4,3,6,2,8,2,3,4,4,
%T A073182 4,9,2,4,4,7,2,8,2,6,6,4,2,7,3,6,4,6,2,6,4,7,4,4,2,12,2,4,6,3,4,8,2,6,
%U A073182 4,8,2,11,2,4,6,6,4,8,2,8,3,4,2,12,4,4,4,7,2,12,4,6,4,4,4,7,2,6,6,9,2,8
%N A073182 Number of divisors of n which are not greater than the cubefree kernel of n.
%C A073182 a(n) >= A073184(n).
%H A073182 Antti Karttunen, <a href="/A073182/b073182.txt">Table of n, a(n) for n = 1..10000</a>
%e A073182 The cubefree kernel of 56 = 7*2^3 is 28 = 7*2^2 and the divisors <= 28 of 56 are {1, 2, 4, 7, 8, 14, 28}, therefore a(56) = 7.
%t A073182 Table[Function[k, DivisorSum[n, 1 &, # <= k &]]@ Apply[Times, FactorInteger[n] /. {p_, e_} /; p > 0 :> p^Min[e, 2]], {n, 102}] (* _Michael De Vlieger_, Jul 18 2017 *)
%o A073182 (PARI) a007948(n) = my(f=factor(n)); for (i=1, #f~, f[i, 2] = min(f[i, 2], 2)); factorback(f);
%o A073182 a(n) = my(cfk = a007948(n)); sumdiv(n, d, d<=cfk); \\ _Michel Marcus_, May 14 2015
%Y A073182 Cf. A000005, A007948, A073183, A073180.
%K A073182 nonn
%O A073182 1,2
%A A073182 _Reinhard Zumkeller_, Jul 19 2002