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.

A377138 Powerful numbers that have more divisors than any smaller powerful number.

This page as a plain text file.
%I A377138 #10 Oct 18 2024 20:26:41
%S A377138 1,4,8,16,32,36,72,144,216,288,432,576,864,900,1728,1800,3600,5400,
%T A377138 7200,10800,14400,21600,32400,43200,64800,86400,88200,176400,264600,
%U A377138 352800,529200,705600,1058400,1587600,2116800,3175200,4233600,6350400,8467200,10584000,12700800
%N A377138 Powerful numbers that have more divisors than any smaller powerful number.
%C A377138 First differs from A283052 at n = 12.
%C A377138 Indices of records in A357669.
%C A377138 The corresponding record values are 1, 3, 4, 5, 6, 9, 12, 15, 16, 18, 20, 21, 24, 27, 28, 36, ... (see the link for more values).
%H A377138 Amiram Eldar, <a href="/A377138/b377138.txt">Table of n, a(n) for n = 1..548</a>
%H A377138 Amiram Eldar, <a href="/A377138/a377138.txt">Table of n, a(n), A357669(a(n)) for n = 1..548</a>
%t A377138 f[p_, e_] := If[e == 1, 1, e + 1]; d[1] = 1; d[n_] := Times @@ f @@@ FactorInteger[n]; With[{v = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {_, _}][[;; , 2]]}, seq = {}; dm = 0; Do[If[(dk = d[v[[k]]]) > dm, dm = dk; AppendTo[seq, v[[k]]]], {k, 1, Length[v]}]; seq]
%Y A377138 Subsequence of A001694 and A025487.
%Y A377138 Cf. A000005, A002182, A283052, A357669, A363194.
%K A377138 nonn
%O A377138 1,2
%A A377138 _Amiram Eldar_, Oct 17 2024