The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205645 Number of nilpotent loops of order 2*prime(n) up to isotopism. 0
3, 64, 3658004, 1023090941561683953759580, 2684673506279593406254437209960379084, 382103603974564085117495134243710834769544696954218618882023686506660 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
Table 5, p. 20, of Clavier. oddprime(n) = A065091(n) = A000040(n-1).
REFERENCES
L. Clavier, About the autotopisms of abelian groups, 2012.
D. Daly and P. Vojtěchovský, Enumeration of nilpotent loops via cohomology, J. Algebra, 322(11):4080-4098, 2009.
H.O. Pflugfelder, Quasigroups and Loops: Introduction, 1990.
J. D. Phillips and P. Vojtěchovský, The varieties of loops of bolmoufang type, Algebra Universalis, 54(3):259-271, 2005.
LINKS
Lucien Clavier, Enumeration of nilpotent loops up to isotopy, arXiv:1201.5659v1 [math.GR], Jan 26, 2012.
EXAMPLE
a(4) = 3658004 because prime(4) = 7 and there are 3658004 nilpotent loops of order 2*7 = 14.
CROSSREFS
Sequence in context: A084883 A304288 A275044 * A326429 A300010 A196798
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Jan 29 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 22:04 EDT 2024. Contains 373102 sequences. (Running on oeis4.)