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 A344755 #14 May 31 2021 21:23:56
%S A344755 6,28,150,496,528,1980,4560,8128,8736,11400,19872,20664,75840,82080,
%T A344755 253080,254880,741744,1627290,5130300,5607360,7529760,19645440,
%U A344755 20718720,33550336,35092512,45643392,45995040,56424960,86944320,169910136,174013920,180442080,196378992,242040960,304577280,314511360,326611440,451344960
%N A344755 Numbers k such that A344753(k) is a multiple of A048250(k), and k is a multiple of A344753(k)/A048250(k).
%C A344755 Numbers k for which A344753(k)/A048250(k) is a divisor of k.
%C A344755 Perfect numbers (A000396, including also any hypothetical odd terms) are included as only on them A001615 coincides with A344753, and because A001615(n) = A003557(n)*A048250(n), with A003557(n) being a divisor of n.
%H A344755 Antti Karttunen, <a href="/A344755/b344755.txt">Table of n, a(n) for n = 1..50 (terms < 2^31)</a>
%H A344755 <a href="/index/O#opnseqs">Index entries for sequences where odd perfect numbers must occur, if they exist at all</a>
%o A344755 (PARI)
%o A344755 A048250(n) = factorback(apply(p -> p+1,factor(n)[,1]));
%o A344755 A344753(n) = sumdiv(n,d,(d<n)*(d+(issquarefree(n/d) * d)));
%o A344755 isA344755(n) = { my(t=A344753(n),u=A048250(n)); ((0==(t%u))&&(0==(n%(t/u)))); };
%Y A344755 Cf. A000396 (subsequence), A001065, A001615, A003557, A306927, A048250, A344753.
%Y A344755 Subsequence of A344754.
%Y A344755 Cf. also A344700.
%K A344755 nonn
%O A344755 1,1
%A A344755 _Antti Karttunen_, May 29 2021