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 A046655 #26 Aug 12 2023 04:37:10 %S A046655 1,42,246,287,728,1434,1673,1880,4264,6237,9799,9855,18330,21352, %T A046655 21385,24856,36531,39990,46655,57270,66815,92664,125255,156570,182665, %U A046655 208182,212949,242879,273265,380511,391345,411558,539560,627215,693160,730145,741096 %N A046655 Numbers whose sum of the squares of divisors is also a square number. %D A046655 Jean-Marie De Koninck, Ces nombres qui nous fascinent, Entry 42, p. 16, Ellipses, Paris, 2008. %H A046655 Amiram Eldar, <a href="/A046655/b046655.txt">Table of n, a(n) for n = 1..1000</a> (terms 1..99 from M. F. Hasler, terms 100..500 from Donovan Johnson) %H A046655 Project Euler, <a href="https://projecteuler.net/problem=211">Problem 211: Divisor Square Sum</a>. %e A046655 a(3) = 246 = 2*3*41 with 8 divisors: 1, 2, 3, 6, 41, 82, 123, 246. The sum of squares of the divisors is 84100 = 290^2, also a square. %t A046655 Select[Range[750000], IntegerQ[Sqrt[DivisorSigma[2, #]]] &] (* _Jayanta Basu_, Jun 27 2013 *) %o A046655 (PARI) for( n=1,10^6, issquare(sigma(n,2)) && print1(n", ")) \\ _M. F. Hasler_, Oct 05 2008 %Y A046655 Cf. A046656, A000290, A001157. %K A046655 nonn %O A046655 1,2 %A A046655 _Labos Elemer_