|
|
|
|
#46 by Alois P. Heinz at Mon Jun 13 12:23:39 EDT 2022
|
|
|
|
#45 by Seiichi Manyama at Mon Jun 13 12:09:27 EDT 2022
|
|
|
|
#44 by Seiichi Manyama at Mon Jun 13 11:52:37 EDT 2022
|
| LINKS
|
Seiichi Manyama, <a href="/A188457/b188457_1.txt">Table of n, a(n) for n = 0..62</a>
|
|
|
|
#43 by Seiichi Manyama at Mon Jun 13 11:52:16 EDT 2022
|
| LINKS
|
Seiichi Manyama, <a href="/A188457/b188457_1.txt">Table of n, a(n) for n = 0..62</a>
|
|
|
|
#42 by Seiichi Manyama at Mon Jun 13 11:52:16 EDT 2022
|
| LINKS
|
Seiichi Manyama, <a href="/A188457/b188457.txt">Table of n, a(n) for n = 0..62</a>
|
| STATUS
|
approved
editing
|
|
|
|
#41 by Joerg Arndt at Mon Feb 22 08:18:45 EST 2021
|
|
|
|
#40 by Geoffrey Critzer at Mon Feb 22 08:16:12 EST 2021
|
|
|
|
#39 by Geoffrey Critzer at Mon Feb 22 08:15:36 EST 2021
|
| COMMENTS
|
a(n) is the number of acyclic binary relations on [n], in other words, a(n) is the number of acyclic 2-multidigraphs. Cf. A137435, A339768. - Geoffrey Critzer, Feb 21 2021
|
| STATUS
|
approved
editing
|
|
|
Discussion
|
Mon Feb 22
| 08:16
| Geoffrey Critzer: I corrected my comment.
|
|
|
|
#38 by Michel Marcus at Mon Feb 22 02:50:35 EST 2021
|
|
|
|
#37 by Joerg Arndt at Mon Feb 22 02:05:09 EST 2021
|
|
|
|