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.

A340864 Numbers k such that both sigma_{-1}(k) > 2 and sigma_0(k)/sigma_{-1}(k) are integers.

This page as a plain text file.
%I A340864 #18 Feb 13 2021 14:51:20
%S A340864 672,30240,32760,2178540,23569920,45532800,142990848,459818240,
%T A340864 1379454720,14182439040,43861478400,51001180160,66433720320,
%U A340864 153003540480,403031236608,704575228896,13661860101120,181742883469056,6088728021160320,14942123276641920,20158185857531904
%N A340864 Numbers k such that both sigma_{-1}(k) > 2 and sigma_0(k)/sigma_{-1}(k) are integers.
%H A340864 Wikipedia, <a href="https://en.wikipedia.org/wiki/Multiply_perfect_number">Multiply perfect number</a>
%H A340864 Wikipedia, <a href="http://www.wikipedia.org/wiki/Harmonic_divisor_number">Harmonic divisor number</a>.
%e A340864 a(1) = 672 is the smallest number k that is both an Ore number and multiperfect such that sigma(k)/k > 2.
%t A340864 Module[{a166069 = {120, 672, 30240, 32760, 523776, 2178540, 23569920, 45532800, 142990848, 459818240, 1379454720}, i, n, result = {}}, For[i = 1, i <= Length[a166069], i++, n = a166069[[i]]; If[Mod[DivisorSigma[0, n], DivisorSigma[-1, n]] == 0, AppendTo[result, n]]]; result]
%Y A340864 Intersection of A001599 and A166069.
%Y A340864 Cf. A007691, A325025.
%K A340864 nonn
%O A340864 1,1
%A A340864 _David Terr_, Jan 24 2021
%E A340864 Name changed by and more terms from _Jinyuan Wang_, Feb 11 2021