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 A069265 #12 Sep 03 2020 06:40:56
%S A069265 4,8,9,16,18,25,32,36,48,49,50,64,72,81,98,100,108,121,128,144,162,
%T A069265 169,192,196,200,225,242,256,288,289,300,324,338,361,392,400,432,441,
%U A069265 450,484,512,529,576,578,588,625,648,676,722,729,768,784,800,841,882,900
%N A069265 Numbers k such that Sum_{d|k} d/core(d) > k, where core(d) is the squarefree part of d.
%H A069265 Amiram Eldar, <a href="/A069265/b069265.txt">Table of n, a(n) for n = 1..10000</a>
%F A069265 k such that A068976(k) > k.
%t A069265 f[p_, e_] := If[OddQ[e], 2*(p^(e + 1) - 1)/(p^2 - 1), (p^(e + 2) + p^e - 2)/(p^2 - 1)]; Select[Range[2, 1000], Times @@ (f @@@ FactorInteger[#]) > # &] (* _Amiram Eldar_, Sep 03 2020 *)
%Y A069265 Cf. A068976, A007913.
%K A069265 easy,nonn
%O A069265 1,1
%A A069265 _Benoit Cloitre_, Apr 14 2002