Home       Trees       Indices       Help   
Package sage :: Package combinat :: Module sloane_functions :: Class SloaneSequence
[hide private]
[frames] | no frames]

Class SloaneSequence

source code

                      object --+    
                               |    
structure.sage_object.SageObject --+
                                   |
                                  SloaneSequence
Known Subclasses:
A000001, A000004, A000005, A000007, A000009, A000010, A000012, A000015, A000016, A000027, A000030, A000032, A000035, A000040, A000041, A000043, A000045, A000069, A000073, A000079, A000085, A000100, A000108, ExponentialNumbers, A000120, A000124, RecurrenceSequence2, A000142, ExtremesOfPermanentsSequence, A000165, A000166, A000169, A000203, A000204, A000213, A000217, A000225, A000244, A000272, A000290, A000292, A000302, A000312, A000326, A000330, A000396, A000578, A000583, A000668, A000670, A000720, A000796, A000961, A000984, A001006, A001055, RecurrenceSequence, A001147, A001157, A001189, A001221, A001222, A001227, A001358, A001405, A001477, A001694, A001836, A001969, A002110, A002113, A002275, A002378, A002620, A002808, A003418, A004086, A004526, A005100, A005101, A005117, A005408, A005843, A006318, A006530, A006882, A007318, A008275, A008277, A008683, A010060, A018252, A020639, A046660, A049310, A061084, A064553, A079922, A079923, A090012, A090013, A090014, A090015, A090016, A111774, A111775, A111776, A111787 
Base class for a Slone integer sequence.

EXAMPLES:
We create a dummy sequence:


Instance Methods [hide private]
 
__init__(self, offset=1)
A sequence starting at offset (=1 by default).		 source code
 
_repr_(self)
EXAMPLES: sage: from sage.combinat.sloane_functions import SloaneSequence sage: SloaneSequence(4)._repr_() Traceback (most recent call last): ...		 source code
 
__cmp__(self, other)
EXAMPLES:...		 source code
 
__call__(self, n)
EXAMPLES: sage: sloane.A000007(2) 0 sage: sloane.A000007('a') Traceback (most recent call last): ...		 source code
 
_eval(self, n)
EXAMPLES: sage: from sage.combinat.sloane_functions import SloaneSequence sage: SloaneSequence(0)._eval(4) Traceback (most recent call last): ...		 source code
 
list(self, n)
Return n terms of the sequence: sequence[offset], sequence[offset+1], ...		 source code
 
__iter__(self)
EXAMPLES: sage: iter(sloane.A000012) Traceback (most recent call last): ...		 source code
 
__getitem__(self, n)
Return sequence[n].		 source code

Inherited from structure.sage_object.SageObject: __hash__, __new__, __repr__, _axiom_, _axiom_init_, _gap_, _gap_init_, _gp_, _gp_init_, _interface_, _interface_init_, _interface_is_cached_, _kash_, _kash_init_, _macaulay2_, _macaulay2_init_, _magma_, _magma_init_, _maple_, _maple_init_, _mathematica_, _mathematica_init_, _maxima_, _maxima_init_, _octave_, _octave_init_, _pari_, _pari_init_, _r_init_, _sage_, _singular_, _singular_init_, category, db, dump, dumps, plot, rename, reset_name, save, version

Inherited from object: __delattr__, __getattribute__, __reduce__, __reduce_ex__, __setattr__, __str__

Properties [hide private]

Inherited from object: __class__

Method Details [hide private]

__init__(self, offset=1)
(Constructor)

source code  

A sequence starting at offset (=1 by default).

EXAMPLES:
    sage: from sage.combinat.sloane_functions import SloaneSequence
    sage: SloaneSequence().offset
    1
    sage: SloaneSequence(4).offset
    4
Overrides: object.__init__

_repr_(self)

source code  

EXAMPLES:
    sage: from sage.combinat.sloane_functions import SloaneSequence
    sage: SloaneSequence(4)._repr_()
    Traceback (most recent call last):
    ...
    NotImplementedError

__cmp__(self, other)
(Comparison operator)

source code  

EXAMPLES:
    sage: cmp(sloane.A000007,sloane.A000045) == 0
    False
    sage: cmp(sloane.A000007,sloane.A000007) == 0
    True

__call__(self, n)
(Call operator)

source code  

EXAMPLES:
    sage: sloane.A000007(2)
    0
    sage: sloane.A000007('a')
    Traceback (most recent call last):
    ...
    TypeError: input must be an int, long, or Integer
    sage: sloane.A000007(-1)
    Traceback (most recent call last):
    ...
    ValueError: input n (=-1) must be an integer >= 0
    sage: sloane.A000001(0)
    Traceback (most recent call last):            
    ...
    ValueError: input n (=0) must be a positive integer

_eval(self, n)

source code  

EXAMPLES:
    sage: from sage.combinat.sloane_functions import SloaneSequence
    sage: SloaneSequence(0)._eval(4)
    Traceback (most recent call last):
    ...
    NotImplementedError

list(self, n)

source code  
Return n terms of the sequence: sequence[offset], sequence[offset+1], ... , sequence[offset+n-1].

EXAMPLES:
  sage: sloane.A000012.list(4)
  [1, 1, 1, 1]

__iter__(self)

source code  

EXAMPLES:
    sage: iter(sloane.A000012)
    Traceback (most recent call last):
    ...
    NotImplementedError

__getitem__(self, n)
(Indexing operator)

source code  
Return sequence[n].

We interpret slices as best we can, but our sequences
are infinite so we want to prevent some mis-incantations.

Therefore, we abitrarily cap slices to be at most
LENGTH=100000 elements long.  Since many Sloane sequences
are costly to compute, this is probably not an unreasonable
decision, but just in case, list does not cap length.

EXAMPLES:
    sage: sloane.A000012[3]
    1
    sage: sloane.A000012[:4]
    [1, 1, 1, 1]
    sage: sloane.A000012[:10]
    [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
    sage: sloane.A000012[4:10]
    [1, 1, 1, 1, 1, 1]
    sage: sloane.A000012[0:1000000000]
    Traceback (most recent call last):
    ...
    IndexError: slice (=slice(0, 1000000000, None)) too long

   Home       Trees       Indices       Help   
Generated by Epydoc 3.0beta1 on Thu Jul 17 04:23:37 2008 http://epydoc.sourceforge.net