login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066060 Number of nilpotent groups of order n. 3
1, 1, 1, 2, 1, 1, 1, 5, 2, 1, 1, 2, 1, 1, 1, 14, 1, 2, 1, 2, 1, 1, 1, 5, 2, 1, 5, 2, 1, 1, 1, 51, 1, 1, 1, 4, 1, 1, 1, 5, 1, 1, 1, 2, 2, 1, 1, 14, 2, 2, 1, 2, 1, 5, 1, 5, 1, 1, 1, 2, 1, 1, 2, 267, 1, 1, 1, 2, 1, 1, 1, 10, 1, 1, 2, 2, 1, 1, 1, 14, 15, 1, 1, 2, 1, 1, 1, 5, 1, 2, 1, 2, 1, 1, 1, 51, 1, 2, 2, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Multiplicative with a(p^m) equal to the number of groups of order p^m.

LINKS

T. D. Noe, Table of n, a(n) for n=1..2015 (using data from A000001)

John Renze, Nilpotent Group.

MATHEMATICA

terms = 101; fgc = FiniteGroupCount[Range[terms]]; a[1] = 1; a[n_ /; PrimePowerQ[n] && 1 < n <= terms] := a[n] = fgc[[n]]; a[n_ /; 1 < n <= terms] := a[n] = Times @@ (a[#[[1]]^#[[2]]]& /@ FactorInteger[n]); Array[a, terms] (* Jean-Fran├žois Alcover, Oct 03 2017 *)

CROSSREFS

Cf. A000001, A056867, A069739.

Sequence in context: A157249 A155586 A069739 * A008550 A064094 A090182

Adjacent sequences:  A066057 A066058 A066059 * A066061 A066062 A066063

KEYWORD

nonn,nice,mult

AUTHOR

Reiner Martin (reinermartin(AT)hotmail.com), Dec 29 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 17:40 EDT 2020. Contains 334630 sequences. (Running on oeis4.)