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 A309806 #41 Feb 16 2020 11:59:13
%S A309806 1,2,3,2,2,3,3,2,2,3,3,2,3,3,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,
%T A309806 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3
%N A309806 Values of k in k-imperfect numbers.
%C A309806 The value of k in k-imperfect numbers, A127724. Except for the first term, all terms are > 1.
%C A309806 It appears that the first instance of a(n)=4 is for n=98 (993803899780063855042560), while no integer is currently known to be 5-imperfect. - _Michel Marcus_, Aug 20 2019
%C A309806 A number n is called k-imperfect iff k := n/rho(n) is an integer, where rho = A206369 is a sum-of divisors function with alternating signs. - _M. F. Hasler_, Feb 14 2020
%H A309806 Michel Marcus, <a href="/A309806/a309806.gp.txt">PARI script</a>
%F A309806 a(n) = m/A206369(m) with m = A127724(n). - _M. F. Hasler_, Feb 14 2020
%e A309806 The first 3 terms of A127724 are 1, 2, and 6, that are respectively 1-, 2-, and 3-imperfect. So the first 3 terms of this sequence are 1, 2 and 3.
%t A309806 {1}~Join~Map[If[IntegerQ@ #, #, Nothing] &[#/Times @@ (Sum[(-1)^(#2 - k) #1^k, {k, 0, #2}] & @@@ FactorInteger[#])] &, Range[2, 10^6]] (* _Michael De Vlieger_, Feb 15 2020 *)
%o A309806 (PARI) lista(lim) = {my(v = []); for (i=1, 4, my(vi = solveIMP(1, i, lim)); v = concat (v, vi);); apply(x->x/rhon(x), vecsort(v));} \\ uses the script in links section
%o A309806 lista(10^24) \\ to get 98 terms; _Michel Marcus_, Aug 20 2019
%o A309806 (PARI) A309806(n)=(n=A127724(n))/A206369(n) \\ _M. F. Hasler_, Feb 14 2020
%Y A309806 Cf. A127724, A127725 (2-imperfect), A127726 (3-imperfect), A206369 (rho).
%K A309806 nonn,more
%O A309806 1,2
%A A309806 _Jud McCranie_, Aug 17 2019
%E A309806 a(45)-a(50) from _Giovanni Resta_, Aug 19 2019