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.

A348342 Noninfinitary highly composite numbers: where the number of noninfinitary divisors (A348341) increases to a record.

This page as a plain text file.
%I A348342 #12 Oct 15 2021 05:54:47
%S A348342 1,4,12,16,36,48,144,240,576,720,1680,2880,3600,5040,11520,14400,
%T A348342 15120,20160,25200,45360,55440,80640,100800,166320,176400,226800,
%U A348342 277200,498960,720720,887040,1108800,1587600,1940400,2494800,3603600,6486480,9979200,11531520,14414400
%N A348342 Noninfinitary highly composite numbers: where the number of noninfinitary divisors (A348341) increases to a record.
%C A348342 The record numbers of noninfinitary divisors are 0, 1, 2, 3, 5, 6, 11, 12, 13, 22, 24, 26, 37, 44, 46, ... (see the link for more values).
%H A348342 Amiram Eldar, <a href="/A348342/b348342.txt">Table of n, a(n) for n = 1..468</a>
%H A348342 Amiram Eldar, <a href="/A348342/a348342.txt">Table of n, a(n), A348341(a(n)) for n = 1..468</a>
%t A348342 nid[1] = 0; nid[n_] := DivisorSigma[0, n] - Times @@ Flatten[2^DigitCount[#, 2, 1] & /@ FactorInteger[n][[;; , 2]]]; dm = -1; s = {}; Do[If[(d = nid[n]) > dm, dm = d; AppendTo[s, n]], {n, 1, 10^6}]; s
%Y A348342 Cf. A348341.
%Y A348342 Subsequence of A025487.
%Y A348342 Similar sequences: A002182, A002110 (unitary), A037992 (infinitary), A293185, A306736, A307845, A309141, A318278, A322484, A335386.
%K A348342 nonn
%O A348342 1,2
%A A348342 _Amiram Eldar_, Oct 13 2021