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.
%I A139669 #19 Oct 19 2024 22:24:44 %S A139669 1,2,4,12,42,195,1387,19324,1083472 %N A139669 Number of isomorphism classes of finite groups of order 11*2^n. %C A139669 This appears to be the smallest possible number of groups of order q*2^n for an odd number q. %C A139669 Apparently, a(n) is also the number of isomorphism classes of finite groups of order 19*2^n and, more generally, of order p*2^n for primes p such that p is congruent to 3 modulo 4 and p+1 is not a power of 2. %C A139669 Comment from _Miles Englezou_, Sep 26 2024: (Start) %C A139669 The comment above which starts "Apparently, ... power of 2." is not true. (For a proof see the Miles Englezou link). However, it is true that a(0) to a(8) are the smallest possible number of groups of order q*2^n for an odd number q, and this can be generalized in the way stated below. (For further details see the Miles Englezou link). %C A139669 A correct generalization of the 9 terms: %C A139669 The number of groups of order q*2^n is the least possible for prime q such that q == 3 (mod 4) and where the least 2^m such that 2^m == 1 (mod q) is greater than 2^n. Or put another way, if A014664(A080148(n)) > n, then for q = A000040(A080148(n)) the number of groups of order q*2^n is the least possible. (End) %D A139669 J. H. Conway et al., The Symmetries of Things, Peters, 2008, p. 206. %H A139669 John H. Conway, Heiko Dietrich and E. A. O'Brien, <a href="http://www.math.auckland.ac.nz/~obrien/research/gnu.pdf">Counting groups: gnus, moas and other exotica</a>. %H A139669 Miles Englezou, <a href="/A139669/a139669.pdf">Proofs</a> %F A139669 a(n) = A000001(11*2^n). - _Max Alekseyev_, Apr 26 2010 %e A139669 a(2) is the number of groups of order 11*2^2=44, which is 4 and also the number of groups of order 19*2^2=76, 23*2^2=92, etc. %p A139669 A139669 := n -> GroupTheory[NumGroups](11*2^n); %Y A139669 Cf. A000001, A002145, A014664, A080148. %K A139669 hard,more,nonn %O A139669 0,2 %A A139669 Anthony D. Elmendorf (aelmendo(AT)calumet.purdue.edu), Jun 12 2008 %E A139669 a(8) from _Max Alekseyev_, Dec 24 2014