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.

A046054 Incrementally largest number of nonisomorphic finite Abelian groups as a function of order.

This page as a plain text file.
%I A046054 #35 Feb 16 2025 08:32:38
%S A046054 1,2,3,5,7,11,15,22,30,42,56,77,101,135,176,231,297,303,385,405,490,
%T A046054 505,528,539,627,675,693,707,792,880,891,945,1002,1155,1232,1255,1485,
%U A046054 1617,1925,1936,2079,2450,2541,2695,3135,3267,3430,3465,3960,4235
%N A046054 Incrementally largest number of nonisomorphic finite Abelian groups as a function of order.
%C A046054 Records in A000688. - _Artur Jasinski_, Mar 14 2008
%H A046054 Amiram Eldar, <a href="/A046054/b046054.txt">Table of n, a(n) for n = 1..1111</a> (terms 1..216 from Charlie Neder)
%H A046054 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AbelianGroup.html">Abelian Group</a>
%H A046054 <a href="/index/Gre#groups">Index entries for sequences related to groups</a>
%F A046054 a(n) = A000688(A046055(n)). - _Amiram Eldar_, Aug 20 2019
%t A046054 a = {}; b = 0; f[n_] := Times @@ PartitionsP /@ Last /@ FactorInteger@n; k = Array[f, 1000000]; Do[If[k[[m]] > b, b = k[[m]]; AppendTo[a, b]], {m, 1, Length[k]}]; a (* using a procedure from _Robert G. Wilson v_; _Artur Jasinski_, Mar 14 2008 *)
%Y A046054 Cf. A000688, A046055, A046056.
%K A046054 nonn
%O A046054 1,2
%A A046054 _Eric W. Weisstein_
%E A046054 More terms from _David Wasserman_, Feb 06 2002