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.

A238877 Members of a pair (a,b) such that a is the number of Abelian groups of order n and b is the number of non-Abelian groups of order n.

This page as a plain text file.
%I A238877 #14 Mar 23 2024 19:47:30
%S A238877 1,0,1,0,1,0,2,0,1,0,1,1,1,0,3,2,2,0,1,1,1,0,2,3,1,0,1,1,1,0,5,9,1,0,
%T A238877 2,3,1,0,2,3,1,1,1,1,1,0,3,12,2,0,1,1,3,2,2,2,1,0,1,3,1,0,7,44,1,0,1,
%U A238877 1,1,0,4,10,1,0,1,1,1,1,3,11,1,0,1,5,1,0
%N A238877 Members of a pair (a,b) such that a is the number of Abelian groups of order n and b is the number of non-Abelian groups of order n.
%C A238877 Pairs (A000688(n),A060689(n)).
%H A238877 Michel Lagneau, <a href="/A238877/b238877.txt">Table of n, a(n) for n = 1..4000</a> [2nd term in the 1024th pair corrected by Andrey Zabolotskiy]
%e A238877 The 8th pair {3,2} is in the sequence because there exists 5 finite groups of order 8: 3 Abelian groups and 2 non-Abelian groups.
%t A238877 lst:={};f[n_]:=Times@@PartitionsP/@Last/@FactorInteger@n;g[n_]:=FiniteGroupCount[n]-FiniteAbelianGroupCount[n];Do[AppendTo[lst,{f[n],g[n]}],{n,80}];Flatten[lst]
%Y A238877 Cf. A000001, A000688, A060689.
%K A238877 nonn
%O A238877 1,7
%A A238877 _Michel Lagneau_, Mar 24 2014