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.

A335396 Numbers m such that sigma(m)/esigma(m) > sigma(k)/esigma(k) for all k < m, where sigma(m) is the sum of divisors of m (A000203) and esigma(m) is the sum of exponential divisors of m (A051377).

This page as a plain text file.
%I A335396 #22 Jun 13 2021 03:23:54
%S A335396 1,2,6,30,96,210,480,1920,3360,13440,36960,147840,480480,1921920,
%T A335396 8168160,11975040,32672640,155675520,620780160,1401079680,2490808320,
%U A335396 2646483840
%N A335396 Numbers m such that sigma(m)/esigma(m) > sigma(k)/esigma(k) for all k < m, where sigma(m) is the sum of divisors of m (A000203) and esigma(m) is the sum of exponential divisors of m (A051377).
%e A335396 The ratio sigma(m)/esigma(m) for m = 1, 2, ..., 6 is 1, 3/2, 4/3, 7/6, 6/5, 2. The record values occur at m = 1, 2 and 6.
%t A335396 f[n_] := DivisorSigma[1,n]/( Times @@ (Sum[ First[#]^d, {d, Divisors[Last[#]]}] & ) /@ FactorInteger[n]); seq = {}; fm = 0; Do[f1 = f[n]; If[f1 > fm, fm = f1; AppendTo[seq, n]], {n, 1, 10^4}]; seq
%Y A335396 Cf. A000203, A051377, A285906, A335400.
%K A335396 nonn,more
%O A335396 1,2
%A A335396 _Amiram Eldar_, Jun 05 2020