cp's OEIS Frontend

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.

A357493 Numbers k such that s(k) = 3*k, where s(k) is the sum of divisors of k that have a square factor (A162296).

This page as a plain text file.
%I A357493 #9 Oct 01 2022 19:29:48
%S A357493 480,2688,56304,89400,195216,2095104,9724032,69441408,1839272960,
%T A357493 5905219584
%N A357493 Numbers k such that s(k) = 3*k, where s(k) is the sum of divisors of k that have a square factor (A162296).
%C A357493 Analogous to 3-perfect numbers (A005820) with nonsquarefree divisors.
%C A357493 Equivalently, numbers k such that A325314(k) = -2*k.
%C A357493 a(11) > 10^11, if it exists.
%C A357493 If k is one of the 6 known 3-perfect numbers, then 4*k is a term.
%e A357493 480 is a term since A162296(480) = 1440 = 3*480.
%t A357493 q[n_] := Module[{f = FactorInteger[n], p, e}, p = f[[;; , 1]]; e = f[[;; , 2]]; Times @@ ((p^(e + 1) - 1)/(p - 1)) - Times @@ (p + 1) == 3*n]; Select[Range[2, 10^7], q]
%Y A357493 Cf. A162296, A325314.
%Y A357493 Subsequence of A013929 and A068403.
%Y A357493 Numbers k such that A162296(k) = m*k: A005117 (m=0), A001248 (m=1), A322609 (m=2), this sequence (m=3), A357494 (m=4).
%Y A357493 Similar sequence: A005820.
%K A357493 nonn,more
%O A357493 1,1
%A A357493 _Amiram Eldar_, Oct 01 2022