Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A123234

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of n X n Latin squares up to row and column permutation (or "RC-equivalence").
(history; published version)
#15 by Michel Marcus at Tue Jul 21 02:48:22 EDT 2020
STATUS

reviewed

approved

#14 by Joerg Arndt at Tue Jul 21 02:39:04 EDT 2020
STATUS

proposed

reviewed

#13 by Michel Marcus at Tue Jul 21 00:34:28 EDT 2020
STATUS

editing

proposed

Discussion
Tue Jul 21
01:17
Dan Eilers: Perfect!  Thanks.
#12 by Michel Marcus at Tue Jul 21 00:33:39 EDT 2020
AUTHOR

Dan Eilers (https://oeis.org/wiki/User:_Dan_ Eilers), _, Oct 06 2006

EXTENSIONS

changed author email to oeis wiki user account

STATUS

proposed

editing

Discussion
Tue Jul 21
00:34
Michel Marcus: if you have an account now, this is what you must do (surround your name with underscores)
#11 by Dan Eilers at Mon Jul 20 22:44:52 EDT 2020
STATUS

editing

proposed

#10 by Dan Eilers at Mon Jul 20 21:57:19 EDT 2020
AUTHOR

Dan Eilers (dan(AT)irvinehttps://oeis.comorg/wiki/User:Dan_Eilers), Oct 06 2006

EXTENSIONS

changed author email to oeis wiki user account

STATUS

approved

editing

#9 by Vaclav Kotesovec at Fri Oct 27 13:07:21 EDT 2017
STATUS

proposed

approved

#8 by Andrey Zabolotskiy at Fri Oct 27 12:14:31 EDT 2017
STATUS

editing

proposed

#7 by Andrey Zabolotskiy at Fri Oct 27 12:00:08 EDT 2017
COMMENTS

"It would be possible to find the counts for n=9 and n=10 using the method of my paper in JCD: http://users.cecs.anu.edu.au/~bdm/papers/ls_final.pdf [see link below]. For n=10 it is probably a 24-digit number. I'll explain the method I used. See the paper above for terminology.

LINKS

B. D. McKay, A. Meynert, W. Myrvold, (2007), <a href="http://users.cecs.anu.edu.au/~bdm/papers/ls_final.pdf">Small latin squares, quasigroups, and loops</a>, J. Combin. Designs, 15 (2007), 98-119. <a href="https://doi.org/10.1002/jcd.20105">doi:10.1002/jcd.20105</a>

<a href="/index/La#Latin">Index entries for sequences related to Latin squares and rectangles</a>

STATUS

approved

editing

#6 by N. J. A. Sloane at Sat Mar 18 16:13:47 EDT 2017
COMMENTS

"It would be possible to find the counts for n=9 and n=10 using the method of my paper in JCD: http://csusers.cecs.anu.edu.au/~bdm/papers/ls_final.pdf. For n=10 it is probably a 24-digit number. I'll explain the method I used. See the paper above for terminology.

Discussion
Sat Mar 18
16:13
OEIS Server: https://oeis.org/edit/global/2618