Skip to content

Commit

Permalink
Trac #30138: 1 internet doctest failing in oeis.py (cross_references)
Browse files Browse the repository at this point in the history
with 9.2.beta5

{{{
sage -t --optional=sage,internet src/sage/databases/oeis.py
}}}

gives

{{{
**********************************************************************
File "src/sage/databases/oeis.py", line 93, in sage.databases.oeis
Failed example:
    p.cross_references(fetch=True)                # optional -- internet
Expected:
    0: A000798: Number of different quasi-orders (or topologies, or
transitive digraphs) with n labeled elements.
    1: A001035: Number of partially ordered sets ("posets") with n
labeled elements (or labeled acyclic transitive digraphs).
    2: A001930: Number of topologies, or transitive digraphs with n
unlabeled nodes.
    3: A006057: Number of topologies on n labeled points satisfying
axioms T_0-T_4.
    4: A079263: Number of constrained mixed models with n factors.
    5: A079265: Number of antisymmetric transitive binary relations on n
unlabeled points.
    6: A263859: Triangle read by rows: T(n,k) (n>=1, k>=0) is the number
of posets with n elements and rank k (or depth k+1).
    7: A316978: Number of factorizations of n into factors > 1 with no
equivalent primes.
    8: A319559: Number of non-isomorphic T_0 set systems of weight n.
    9: A326939: Number of T_0 sets of subsets of {1..n} that cover all n
vertices.
    10: A326943: Number of T_0 sets of subsets of {1..n} that cover all
n vertices and are closed under intersection.
    ...
Got:
     0: A000798: Number of different quasi-orders (or topologies, or
transitive digraphs) with n labeled elements.
     1: A001035: Number of partially ordered sets ("posets") with n
labeled elements (or labeled acyclic transitive digraphs).
     2: A001930: Number of topologies, or transitive digraphs with n
unlabeled nodes.
     3: A006057: Number of topologies on n labeled points satisfying
axioms T_0-T_4.
     4: A079263: Number of constrained mixed models with n factors.
     5: A079265: Number of antisymmetric transitive binary relations on
n unlabeled points.
     6: A263859: Triangle read by rows: T(n,k) (n>=1, k>=0) is the
number of posets with n elements and rank k (or depth k+1).
     7: A000608: Number of connected partially ordered sets with n
unlabeled elements.
     8: A316978: Number of factorizations of n into factors > 1 with no
equivalent primes.
     9: A319559: Number of non-isomorphic T_0 set systems of weight n.
    10: A326939: Number of T_0 sets of subsets of {1..n} that cover all
n vertices.
    11: A326943: Number of T_0 sets of subsets of {1..n} that cover all
n vertices and are closed under intersection.
    12: A326944: Number of T_0 sets of subsets of {1..n} that cover all
n vertices, contain {}, and are closed under intersection.
    13: A326947: BII-numbers of T_0 set-systems.
**********************************************************************
1 item had failures:
   1 of  26 in sage.databases.oeis
    5 webbrowser tests not run
    0 tests not run because we ran out of time
    [287 tests, 1 failure, 42.09 s]
}}}

URL: https://trac.sagemath.org/30138
Reported by: slabbe
Ticket author(s): Sébastien Labbé
Reviewer(s): Frédéric Chapoton
  • Loading branch information
Release Manager committed Jul 28, 2020
2 parents 9789327 + 1dc8a3b commit f6e88bc
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion src/sage/databases/oeis.py
Original file line number Diff line number Diff line change
Expand Up @@ -90,7 +90,7 @@
::
sage: p.cross_references(fetch=True) # optional -- internet
sage: p.cross_references(fetch=True) # optional -- internet # random
0: A000798: Number of different quasi-orders (or topologies, or transitive digraphs) with n labeled elements.
1: A001035: Number of partially ordered sets ("posets") with n labeled elements (or labeled acyclic transitive digraphs).
2: A001930: Number of topologies, or transitive digraphs with n unlabeled nodes.
Expand Down

0 comments on commit f6e88bc

Please sign in to comment.