# HG changeset patch # User Thierry Monteil # Date 1286117760 -7200 # Node ID 9e4c60383833c9bdb244e4a2c1280ba35b6805d4 # Parent 7bd3a9f93d56b0b5bf03551164d9d971cca9a141 #10056 Change OEIS database internet address to its new adrress. diff --git a/sage/coding/sd_codes.py b/sage/coding/sd_codes.py --- a/sage/coding/sd_codes.py +++ b/sage/coding/sd_codes.py @@ -167,7 +167,7 @@ def self_dual_codes_binary(n): n 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 B_n 1 1 1 2 2 3 4 7 9 16 25 55 103 261 731 - According to http://www.research.att.com/~njas/sequences/A003179, + According to http://oeis.org/classic/A003179, the next 2 entries are: 3295, 24147. EXAMPLES:: diff --git a/sage/combinat/sloane_functions.py b/sage/combinat/sloane_functions.py --- a/sage/combinat/sloane_functions.py +++ b/sage/combinat/sloane_functions.py @@ -397,7 +397,7 @@ class A000027(SloaneSequence): SloaneSequence.__init__(self, offset=1) # is this a good idea to have a link for all sequences? Jaap - link = "http://www.research.att.com/~njas/sequences/A000027" + link = "http://oeis.org/classic/A000027" def _repr_(self): """ @@ -6846,7 +6846,7 @@ class A001110(RecurrenceSequence): self._b = [] self._precompute() - link = "http://www.research.att.com/~njas/sequences/A001110" + link = "http://oeis.org/classic/A001110" def _repr_(self): """ diff --git a/sage/databases/sloane.py b/sage/databases/sloane.py --- a/sage/databases/sloane.py +++ b/sage/databases/sloane.py @@ -53,10 +53,9 @@ with Sage:: Searching Sloane's online database... [[137443, 'First n-digit prime in consecutive digits of e.', [7, 71, 281, 4523, 74713, 904523, 6028747, 72407663, 360287471, 7427466391, 75724709369, 749669676277, 8284590452353, 99959574966967, 724709369995957, 2470936999595749, 28459045235360287, 571382178525166427]]] -Note that the OEIS (http://www.research.att.com/ njas/sequences/) -claims to limit the number of results to 100. Results are lists of -the form [ [number, description, list]], and invalid input will -cause sloane_find to return []. +Note that the OEIS (http://oeis.org/classic/) claims to limit the number of +results to 100. Results are lists of the form [[number, description, list]], +and invalid input will cause sloane_find to return []. In some cases, these functions may return [] even though the inputs are legal. These cases correspond to errors from the OEIS server, @@ -237,7 +236,7 @@ class SloaneEncyclopediaClass: return answer - def install(self, oeis_url="http://www.research.att.com/~njas/sequences/stripped.gz", names_url="http://www.research.att.com/~njas/sequences/names.gz", overwrite=False): + def install(self, oeis_url="http://oeis.org/classic/stripped.gz", names_url="http://oeis.org/classic/names.gz", overwrite=False): """ Download and install the online encyclopedia, raising an IOError if either step fails. @@ -545,7 +544,7 @@ def sloane_find(list, nresults = 30, ver try: if verbose: print "Searching Sloane's online database..." - url = "http://www.research.att.com/~njas/sequences/" + url = "http://oeis.org/classic/" f = urllib.urlopen(url+'?'+urlparams); s = f.read() f.close() diff --git a/sage/graphs/digraph_generators.py b/sage/graphs/digraph_generators.py --- a/sage/graphs/digraph_generators.py +++ b/sage/graphs/digraph_generators.py @@ -138,8 +138,7 @@ class DiGraphGenerators(): sage: len(L) 75 - Generate digraphs on the fly: (see - http://www.research.att.com/~njas/sequences/A000273) + Generate digraphs on the fly: (see http://oeis.org/classic/A000273) :: diff --git a/sage/graphs/graph_generators.py b/sage/graphs/graph_generators.py --- a/sage/graphs/graph_generators.py +++ b/sage/graphs/graph_generators.py @@ -359,7 +359,7 @@ class GraphGenerators(): 45 Generate all bipartite graphs on up to 7 vertices: (see - http://www.research.att.com/~njas/sequences/A033995) + http://oeis.org/classic/A033995) :: @@ -379,8 +379,7 @@ class GraphGenerators(): sage: len(L) # long time 303 - Generate graphs on the fly: (see - http://www.research.att.com/~njas/sequences/A000088) + Generate graphs on the fly: (see http://oeis.org/classic/A000088) :: @@ -395,7 +394,7 @@ class GraphGenerators(): 156 Generate all simple graphs, allowing loops: (see - http://www.research.att.com/~njas/sequences/A000666) + http://oeis.org/classic/A000666) :: @@ -409,7 +408,7 @@ class GraphGenerators(): 5 544 Generate all graphs with a specified degree sequence (see - http://www.research.att.com/~njas/sequences/A002851):: + http://oeis.org/classic/A002851):: sage: for i in [4,6,8]: ... print i, len([g for g in graphs(i, deg_seq=[3]*i) if g.is_connected()]) diff --git a/sage/rings/rational_field.py b/sage/rings/rational_field.py --- a/sage/rings/rational_field.py +++ b/sage/rings/rational_field.py @@ -334,7 +334,7 @@ class RationalField(_uniq, number_field_ #described in [CalkinWilf]. #REFERENCES: # [A002487] Sloane's OLEIS, - # http://www.research.att.com/~njas/sequences/A002487 + # http://oeis.org/classic/A002487 # [CalkinWilf] N. Calkin and H.S. Wilf, Recounting the # rationals, American Mathematical Monthly 107 (2000), # 360--363 diff --git a/sage/symbolic/constants.py b/sage/symbolic/constants.py --- a/sage/symbolic/constants.py +++ b/sage/symbolic/constants.py @@ -1336,7 +1336,7 @@ class Brun(LimitedPrecisionConstant): """ conversions = dict(maxima='brun') - # digits come from Sloane's tables at http://www.research.att.com/~njas/sequences/table?a=65421&fmt=0 + # digits come from Sloane's tables at http://oeis.org/classic/table?a=65421&fmt=0 value = "1.902160583104" LimitedPrecisionConstant.__init__(self, name, value,