[go: up one dir, main page]

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”).

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

newer changes | Showing entries 11-20 | older changes
Jordan-Polya numbers: products of factorial numbers A000142.
(history; published version)
#100 by Peter Luschny at Thu Dec 30 00:34:16 EST 2021
STATUS

proposed

approved

#99 by Andrew Howroyd at Wed Dec 29 20:41:02 EST 2021
STATUS

editing

proposed

#98 by Andrew Howroyd at Wed Dec 29 20:37:45 EST 2021
COMMENTS

Possible numbers of transitive orientations of comparability graphs (Golumbic, 1977) - David Eppstein, Dec 29 2021

Possible numbers of transitive orientations of comparability graphs (Golumbic, 1977). - David Eppstein, Dec 29 2021

STATUS

proposed

editing

Discussion
Wed Dec 29
20:41
Andrew Howroyd: Not everyone is able to accurately make such deductions. It is better that additions to the comments section are signed to avoid confusion.
#97 by David Eppstein at Wed Dec 29 20:36:14 EST 2021
STATUS

editing

proposed

#96 by David Eppstein at Wed Dec 29 20:35:21 EST 2021
COMMENTS

Possible numbers of transitive orientations of comparability graphs (Golumbic, 1977) - _David Eppstein_, Dec 29 2021

STATUS

proposed

editing

Discussion
Wed Dec 29
20:36
David Eppstein: I thought that since the reference made it clearly not an original contribution by me, it didn't need a signature. But ok, signed.
#95 by David Eppstein at Wed Dec 29 20:05:41 EST 2021
STATUS

editing

proposed

Discussion
Wed Dec 29
20:10
Andrew Howroyd: You have forgotten to sign your new comment.
#94 by David Eppstein at Wed Dec 29 20:05:15 EST 2021
COMMENTS

Possible numbers of transitive orientations of comparability graphs (Golumbic, 1977)

LINKS

Martin Charles Golumbic, <a href="https://doi.org/10.1016/0095-8956(77)90049-1">Comparability graphs and a new matroid</a>, Journal of Combinatorial Theory, Series B, Vol. 22, No. 1 (1977), pp. 68-90.

STATUS

approved

editing

#93 by N. J. A. Sloane at Tue Dec 28 17:22:45 EST 2021
COMMENTS

A000079, A000400 and A009968 are all subsequences. - Bill McEachen, Nov 18 2021

CROSSREFS

Cf. A000079, A000400, A009968. - Bill McEachen, Nov 22 2021

STATUS

proposed

approved

#92 by Bill McEachen at Tue Nov 23 09:13:59 EST 2021
STATUS

editing

proposed

Discussion
Tue Nov 23
09:37
Joerg Arndt: Well, (n!)^k is a term for n >= 1 and k >=1.  More generally a(n)^k is a term for all n and k >= 1. Still more generally, a(k)*a(j) is a term for all k and j, so not sure the comment really adds anything of substance.
Thu Dec 23
03:42
David Eppstein: These edits have been open for a month. Can they somehow be resolved? They are getting in the way of a more substantive edit that I want to make to this sequence: these numbers are the numbers of transitive orientations of comparability graphs. See:  Golumbic, Martin Charles (1977), "Comparability graphs and a new matroid", Journal of Combinatorial Theory, Series B, 22 (1): 68-90, https://doi.org/10.1016%2F0095-8956%2877%2990049-1, https://www.ams.org/mathscinet-getitem?mr=0439689
#91 by Bill McEachen at Mon Nov 22 14:19:58 EST 2021
COMMENTS

A000079 is a subsequence, A000400 and A009968 are all subsequences. - Bill McEachen, Nov 18 2021

CROSSREFS

Cf. A000079, A000400, A009968. - _Bill McEachen_, Nov 22 2021

STATUS

proposed

editing

Discussion
Mon Nov 22
14:20
Bill McEachen: ok, done, thanks.