gh-39489: fix several oeis related doctests
    
by using ... to make the doctests more robusts

### 📝 Checklist

- [x] The title is concise and informative.
- [x] The description explains in detail what this PR is about.
    
URL: #39489
Reported by: Frédéric Chapoton
Reviewer(s):

Author: Release Manager

src/doc/en/developer/coding_basics.rst

@@ -1308,9 +1308,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.

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', ...),

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: ...
 
     ::
 

src/sage/rings/lazy_series.py

@@ -1481,8 +1481,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`::