Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix several oeis related doctests #39489

Open
wants to merge 3 commits into
base: develop
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 1 addition & 3 deletions src/doc/en/developer/coding_basics.rst
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down
3 changes: 1 addition & 2 deletions src/sage/combinat/quickref.py
Original file line number Diff line number Diff line change
Expand Up @@ -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', ...),
Expand Down
2 changes: 1 addition & 1 deletion src/sage/combinat/species/library.py
Original file line number Diff line number Diff line change
Expand Up @@ -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: ...

::

Expand Down
4 changes: 2 additions & 2 deletions src/sage/rings/lazy_series.py
Original file line number Diff line number Diff line change
Expand Up @@ -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`::
Expand Down
Loading