Discussion
Fri Jul 26
16:13
Michael De Vlieger: Hope you get better Jon.
COMMENTS
Conjecture: a(3) = 206 = 2*103 and a(4) = 500015 = 5*100003 are the only semiprime terms.
Discussion
Fri Jul 26
15:58
Jon E. Schoenfield: @Editors: I saw just now that someone had emailed me asking for a proof of the assertion that I've now prefaced with "Conjecture: ". I wouldn't have made that assertion without being satisfied that I had proved it. But that was several weeks ago, and I apologize that I don't remember much about this sequence or the reasoning behind that assertion, and given my current health situation, I regret that I don't have time to look into this further, so I've just inserted "Conjecture: " before the assertion. I hope that's okay. If you think it would be better just to delete the assertion altogether, please do so. Thanks.
Boolean-Chain Quilt Numbers: Square table of the number of ASM quilts of type B_n X C_k read down antidiagonals, where B_n is the Boolean lattice on an n-set and C_k is a chain of length k with k+1 elements.
(history;
published version)
Discussion
Sun Jul 21
05:16
Jon E. Schoenfield: Needs keyword “more”.
05:17
Jon E. Schoenfield: Stray extra space in Crossrefs.
Antichain-Boolean Quilt Numbers: Square table of the number of ASM quilts of type B_n x A_2(j) read down antidiagonals, where B_n is the Boolean lattice and A_2(j) is the rank 2 poset with a unique minimal and maximal element and j atoms.
(history;
published version)
Discussion
Sun Jul 21
05:18
Jon E. Schoenfield: Needs keyword “more”.
Triangle read by rows: T(n,k) is the number of functions on the Boolean lattice B_n satisfying f({}) =0, f([n])=k, and the Boolean growth rule: f(J union {i})-f(J) in {0,1} for all subsets J of [n]={1, ..., n} and all i in [n]\J, 0 <= k <= n.
(history;
published version)
Discussion
Sun Jul 21
05:16
Jon E. Schoenfield: Needs keyword “more”.
05:18
Jon E. Schoenfield: Missing spaces (after commas) in Crossrefs.
05:19
Jon E. Schoenfield: Stray spaces in Name field.
Antichain-Chain Quilt Numbers: Square table of the number of ASM quilts of type A_2(j) x C_k read down antidiagonals, where C_k is the chain poset or rank k and A_2(j) is the rank 2 poset with a unique minimal and maximal element and j atoms
(history;
published version)
Discussion
Sun Jul 21
05:15
Jon E. Schoenfield: Length of Data field is extremely excessive. Traditional guideline is 260 characters (including digits, commas, and spaces). You could submit a b-file with additional terms.
05:21
Jon E. Schoenfield: Spacing in Crossrefs is messed up.
Boolean-Boolean Quilt Numbers: Triangular array T(n,k) of the number of ASM quilts of type B_n X B_k, where B_n is the Boolean lattice of subsets of an n-set ordered by inclusion.
(history;
published version)
Discussion
Sun Jul 21
05:12
Jon E. Schoenfield: Needs keyword “more”.
Discussion
Sun Jul 21
05:04
Jon E. Schoenfield: The Links entry is not properly formatted so that it will be a clickable link …
05:05
Jon E. Schoenfield: Please see
https://oeis.org/wiki/Style_Sheet#Links
05:06
Jon E. Schoenfield: Also need keyword “more”.
05:07
Jon E. Schoenfield: ’Any crossrefs to related sequences?
