files giving extended versions of sequences

[Brendan McKay]

To handle oddities like missing or uncertain values, allow comments
in an easily-filterable format. For example, a line with "#" in
column one could be a comment. This is trivial to filter out for
applications and also allows the file to be internally documented
(A-number and author, for example).  Also allow blank lines as
that will be easier than coping with those that will inevitably
be often present in submitted files.

Brendan.

* N. J. A. Sloane <njas at research.att.com> [060520 04:02]:
> 
> Often one wants more terms than are shown in the OEIS.
> 
> The new plan is to have plain text files for this, with names like 
> b000108.txt
> 
> They are indicated by an initial "b".
> 
> The format is a list of pairs  "n a(n)" with no commas, like this:
> (This is b000045.txt, the Fibonacci numbers A000045)
> 
> 0 0
> 1 1
> 2 1 
> 3 2   
> 4 3   
> 5 5   
> 6 8 
> 7 13   
> 8 21 
> 9 34
> ...
> 499 86168291600238450732788312165664788095941068326060883324529903470149056115823592713458328176574447204501
> 500 139423224561697880139724382870407283950070256587697307264108962948325571622863290691557658876222521294125
> 
> No commas, no text, no line breaks, one line per entry.
> Of course use the correct offset.
> If it is a list, usually the offset is 1.
> 
> How many terms?  It depends. I have been giving 10,000 terms
> for some of the basic sequences like A000005.
> For sequences which grow rapidly, like the Fibonacci numbers
> shown above, 500 terms may be enough.
> For a finite sequence (which is not too long), give them all.
> 
> So far I have these files:
> 
> -rw-r--r--    3 njas     njas       72115 May 19 12:56 b000005.txt
> -rw-r--r--    3 njas     njas       96752 May 19 07:37 b000010.txt
> -rw-r--r--    2 njas     njas      107876 May 19 07:37 b000040.txt
> -rw-r--r--    2 njas     njas       28899 May 19 07:38 b000045.txt
> -rw-r--r--    3 njas     njas       12483 May 19 07:40 b000108.txt
> -rw-r--r--    2 njas     njas      112102 May 19 13:33 b000201.txt
> -rw-r--r--    2 njas     njas       83635 May 19 12:58 b001223.txt
> -rw-r--r--    2 njas     njas       72815 May 19 07:40 b004718.txt
> -rw-r--r--    2 njas     njas      260773 May 19 07:41 b007318.txt
> -rw-r--r--    2 njas     njas      119962 May 19 13:38 b010060.txt
> -rw-r--r--    2 njas     njas       98458 May 19 13:10 b046901.txt
> -rw-r--r--    2 njas     njas        2892 May 19 13:24 b049076.txt
> -rw-r--r--    3 njas     njas        1972 Mar 29 15:36 b051169.txt
> -rw-r--r--    2 njas     njas       82409 May 19 07:39 b056239.txt
> -rw-r--r--    2 njas     njas        1524 May 19 13:16 b114835.txt
> -rw-r--r--    2 njas     njas        5652 May 19 13:13 b115569.txt
> -rw-r--r--    2 njas     njas        8394 May 19 13:07 b117153.txt
> -rw-r--r--    2 njas     njas        6945 May 19 13:08 b117154.txt
> -rw-r--r--    3 njas     njas        4136 May 19 07:39 b117825.txt
> 
> They will be indicated in the OEIS by lines like this:
> 
> %H A010060 Author's name, <a href="http://www.research.att.com/~njas/sequences/b010060.txt">Table of n, a(n) for n = 0..16383</a>
> 
> and this will usually be the first %H line.
> 
> This is an experiment. Comments welcomed.
> 
> One application for this is so that one can listen to a good chunk
> of the sequence using the new "listen" button.
> 
> Contributions also welcomed, but use restraint. There are a lot of sequences
> in the OEIS where we need fewer terms, not more!
> 
> Neil Sloane