From bf658617995c4f39c83da21748f16677355ca105 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Fr=C3=A9d=C3=A9ric=20Chapoton?= Date: Mon, 10 Feb 2025 22:05:42 +0100 Subject: [PATCH 1/3] fix two oeis related doctests --- src/doc/en/developer/coding_basics.rst | 4 +--- src/sage/combinat/quickref.py | 3 +-- 2 files changed, 2 insertions(+), 5 deletions(-) diff --git a/src/doc/en/developer/coding_basics.rst b/src/doc/en/developer/coding_basics.rst index 02936d3e423..0ac10e44f12 100644 --- a/src/doc/en/developer/coding_basics.rst +++ b/src/doc/en/developer/coding_basics.rst @@ -1302,9 +1302,7 @@ framework. Here is a comprehensive list: For lines that require an internet connection:: sage: oeis(60843) # optional - internet - A060843: Busy Beaver problem: a(n) = maximal number of steps that an - n-state Turing machine can make on an initially blank tape before - eventually halting. + A060843: ... - **known bugs:** For lines that describe known bugs, you can use ``# optional - bug``, although ``# known bug`` is preferred. diff --git a/src/sage/combinat/quickref.py b/src/sage/combinat/quickref.py index ee7d9ca8ec1..dacdc266ef1 100644 --- a/src/sage/combinat/quickref.py +++ b/src/sage/combinat/quickref.py @@ -4,8 +4,7 @@ Integer Sequences:: sage: s = oeis([1,3,19,211]); s # optional - internet - 0: A000275: Coefficients of a Bessel function (reciprocal of J_0(z)); - also pairs of permutations with rise/rise forbidden. + 0: A000275: ... sage: s[0].programs() # optional - internet [('maple', ...), ('mathematica', ...), From 2a4c8cd1a125b8aa5f296b54b1012e35b997b061 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Fr=C3=A9d=C3=A9ric=20Chapoton?= Date: Mon, 10 Feb 2025 22:11:42 +0100 Subject: [PATCH 2/3] fix one more --- src/sage/combinat/species/library.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/sage/combinat/species/library.py b/src/sage/combinat/species/library.py index c50a9fe75fa..4ab233c3bb3 100644 --- a/src/sage/combinat/species/library.py +++ b/src/sage/combinat/species/library.py @@ -56,7 +56,7 @@ def SimpleGraphSpecies(): sage: seq = S.isotype_generating_series().counts(6)[1:] # needs sage.modules sage: oeis(seq)[0] # optional - internet # needs sage.modules - A000088: Number of graphs on n unlabeled nodes. + A000088: ... :: From f7438fcfc713efb7f7aaf4262a9c092bb2e9bf46 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Fr=C3=A9d=C3=A9ric=20Chapoton?= Date: Mon, 10 Feb 2025 22:15:14 +0100 Subject: [PATCH 3/3] one more fix --- src/sage/rings/lazy_series.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/sage/rings/lazy_series.py b/src/sage/rings/lazy_series.py index b801c6f1b57..b1d370a3bd4 100644 --- a/src/sage/rings/lazy_series.py +++ b/src/sage/rings/lazy_series.py @@ -1482,8 +1482,8 @@ def define(self, s): sage: f 1 + t + t^2 + 2*t^3 + 6*t^4 + 23*t^5 + 104*t^6 + O(t^7) sage: oeis(f[1:20]) # optional - internet - 0: A030266: Shifts left under COMPOSE transform with itself. - 1: A110447: Permutations containing 3241 patterns only as part of 35241 patterns. + 0: A030266: ... + 1: A110447: ... The following can only work for power series, where we have a minimal valuation of `0`::