The new OEIS search page!!!!!

[wouter meeussen]

>>Note that you can now search for multiple things like:
>>   1,2,3,4,5  "partial sums"  author:njas  keyword:nice

the syntax of such 'multiple things' is well designed!

1 problem:
compare  A051912 in old & new versions: the new program
has lost the second row of the description:
a[n] = smallest integer such that the sum of any three ordered terms a[k; k
instead of:
a[n] = smallest integer such that the sum of any three ordered terms a[k;
              k<n ] is unique.

suggestion: check for such special characters in description.

overall: excellent.
thanx for the continuing commitment,
and have a nice 2006.

Wouter.
< -1+2^30402457 is big & prime >


----- Original Message ----- 
From: "N. J. A. Sloane" <njas at research.att.com>
To:
Cc: <njas at research.att.com>
Sent: Wednesday, December 28, 2005 10:39 AM
Subject: The new OEIS search page!!!!!



There is a new lookup page under development - please try

http://www.research.att.com/~njas/nsequences/index.html

This will eventually (maybe quite soon)
replace the existing lookup page
http://www.research.att.com/~njas/sequences/index.html

Click the Advanced Search button to get instructions: this points to
the URL http://www.research.att.com/~njas/nsequences/index2.html

Note that you can now search for multiple things like

   1,2,3,4,5  "partial sums"  author:njas  keyword:nice

It is also very fast.

Please report any problems to njas.  Several things still need to be fixed
(the Demo pages and the Index files, in particular)

Thanks to Russ Cox, who spent countless hours writing the new programs.

Some of the ideas were contributed by Alex Healy, and David Applegate
played a key role in getting them running on the local machine.

Neil