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 A232354 #38 Mar 05 2022 00:23:08 %S A232354 1,39,793,2379,7137,13167,76921,78507,230763,238887,549549,692289, %T A232354 863577,1491633,1672209,2076867,4317885,7615179,8329831,10441431, %U A232354 23402223,24989493,37776123,53306253,53695813,55871145,74968479,83766969,133854435,144688401,161087439,189437391 %N A232354 Numbers k that divide sigma(k^2) where sigma is the sum of divisors function (A000203). %C A232354 Squarefree terms are: 1, 39, 793, 2379, 76921, 230763, 8329831, 24989493, 53695813, 161087439, ... Quotients are: 1, 61, 873, 3783, 11737, 26543, 85563, 141911, 370773, 417263, 1155561, ... - _Michel Marcus_, Nov 23 2013 %C A232354 Many terms are also in sequence A069520, cf. A232067 for the intersection of these two sequences. - _M. F. Hasler_, Nov 24 2013 %H A232354 Donovan Johnson, <a href="/A232354/b232354.txt">Table of n, a(n) for n = 1..200</a> %H A232354 Jose Arnaldo Bebita Dris, <a href="https://arxiv.org/abs/2202.08116">A new approach to odd perfect numbers via GCDs</a>, arXiv:2202.08116 [math.NT], 2022. %F A232354 A065764(a(n)) mod a(n) = 0. %t A232354 Select[Range[10^5], Divisible[DivisorSigma[1, #^2], #] &] (* _Alonso del Arte_, Dec 06 2013 *) %o A232354 (PARI) isok(n) = (sigma(n^2) % n) == 0; \\ _Michel Marcus_, Nov 23 2013 %Y A232354 Cf. A000203, A007691, A065764, A069520, A227302, A232067, A232703, A232704. %K A232354 nonn %O A232354 1,2 %A A232354 _Alex Ratushnyak_, Nov 22 2013