login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A128704
Number of groups of order A128703(n).
3
2, 1, 1, 5, 2, 1, 3, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 15, 1, 4, 1, 2, 2, 1, 2, 1, 7, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 4, 1, 1, 1, 1, 5, 1, 2, 2, 2, 1, 1, 1, 4, 2, 2, 1, 1, 1, 1, 2, 1, 2, 55, 2, 1, 1, 2, 1, 2, 15, 1, 2, 1, 1, 2, 4, 1, 2, 1, 1, 5, 2, 2, 1, 1, 1, 1, 4, 1, 2, 1, 1, 21, 1, 1, 1, 2
OFFSET
1,1
COMMENTS
Number of groups for orders of form 5^k*p, where 1 <= k <= 5 and p is a prime different from 5.
The groups of these orders (up to A128703(69556991) = 5368708945 in version V2.13-4) form a class contained in the Small Groups Library of MAGMA.
LINKS
MAGMA Documentation, Database of Small Groups
FORMULA
a(n) = A000001(A128703(n)).
EXAMPLE
A128703(20) = 275 and there are 4 groups of order 275 (A000001(275) = 4), hence a(20) = 4.
PROG
(Magma) D:=SmallGroupDatabase(); [ NumberOfSmallGroups(D, n): n in [ h: h in [1..2000] | #t eq 2 and ((t[1, 1] lt 5 and t[1, 2] eq 1 and t[2, 1] eq 5 and t[2, 2] le 5) or (t[1, 1] eq 5 and t[1, 2] le 5 and t[2, 2] eq 1)) where t is Factorization(h) ] ];
CROSSREFS
Cf. A000001 (number of groups of order n), A128703 (numbers of form 5^k*p, 1<=k<=5, p!=5 prime), A128604 (number of groups for orders that divide p^6, p prime), A128644 (number of groups for orders that have at most 3 prime factors), A128645 (number of groups for orders of form 2^k*p, 1<=k<=8, p>2 prime), A128694 (number of groups for orders of form 3^k*p, 1<=k<=6, p!=3 prime).
Sequence in context: A319171 A047888 A330964 * A075259 A307877 A259703
KEYWORD
nonn
AUTHOR
Klaus Brockhaus, Mar 26 2007
STATUS
approved