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.

A348632 Nonexponential highly composite numbers: where the number of nonexponential divisors (A160097) increases to a record.

This page as a plain text file.
%I A348632 #13 May 08 2022 05:07:46
%S A348632 1,6,12,24,30,60,120,210,240,360,420,720,840,1260,1680,2520,3360,5040,
%T A348632 7560,9240,10080,15120,18480,25200,27720,36960,50400,55440,83160,
%U A348632 110880,166320,221760,277200,332640,480480,498960,554400,665280,720720,1081080,1441440
%N A348632 Nonexponential highly composite numbers: where the number of nonexponential divisors (A160097) increases to a record.
%C A348632 The corresponding record values are 1, 3, 4, 6, 7, 10, 14, 15, 17, 20, 22, 24, ... (see the link for more values).
%H A348632 Amiram Eldar, <a href="/A348632/b348632.txt">Table of n, a(n) for n = 1..651</a>
%H A348632 Amiram Eldar, <a href="/A348632/a348632.txt">Table of n, a(n), A160097(a(n)) for n = 1..651</a>
%t A348632 f1[p_, e_] := e + 1; f2[p_, e_] := DivisorSigma[0, e]; ned[1] = 1; ned[n_] := Times @@ f1 @@@ (f = FactorInteger[n]) - Times @@ f2 @@@ f; dm = -1; s = {}; Do[If[(d = ned[n]) > dm, dm = d; AppendTo[s, n]], {n, 1, 10^6}]; s
%Y A348632 Cf. A160097.
%Y A348632 Subsequence of A025487.
%Y A348632 Similar sequences: A002182, A002110 (unitary), A037992 (infinitary), A293185, A306736, A307845, A309141, A318278, A322484, A335386.
%K A348632 nonn
%O A348632 1,2
%A A348632 _Amiram Eldar_, Oct 26 2021