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 A055710 #33 Feb 25 2024 05:57:54
%S A055710 1,10,26,60,65,130,150,228,260,442,650,780,876,988,1105,1140,1460,
%T A055710 1690,1950,2210,2850,2964,3211,3796,4380,4420,4940,5070,5475,5548,
%U A055710 6010,6422,8840,9633,10950,11050,11388,11972,12350,12818,13260,13756,14820,16644
%N A055710 Numbers k such that k | sigma_6(k).
%C A055710 sigma_6(k) is the sum of the 6th powers of the divisors of k (A013954).
%C A055710 Problem 11090 proves that this sequence is infinite. - _T. D. Noe_, Apr 18 2006
%H A055710 Amiram Eldar, <a href="/A055710/b055710.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..450 from Harvey P. Dale)
%H A055710 Florian Luca and John Ferdinands, <a href="http://www.jstor.org/stable/27641939">Problem 11090: Sometimes n divides sigma_k(n)</a>, Amer. Math. Monthly 113:4 (2006), pp. 372-373.
%t A055710 Do[If[Mod[DivisorSigma[6, n], n]==0, Print[n]], {n, 1, 25000}]
%t A055710 Select[Range[20000],Divisible[DivisorSigma[6,#],#]&] (* _Harvey P. Dale_, Jun 04 2015 *)
%o A055710 (PARI) is(n)=sigma(n,6)%n==0 \\ _Charles R Greathouse IV_, Feb 04 2013
%Y A055710 Cf. A013954.
%Y A055710 Cf. A055709, A055711, A055712, A055713.
%K A055710 nonn
%O A055710 1,2
%A A055710 _Robert G. Wilson v_, Jun 09 2000