If you would be willing to check the translation into some language, there are 9 little tests to do. They should only take a few seconds each.

Please tell me if you see anything wrong. I would like the translations to be correct in every way.

Thank you. Neil Sloane (njas@research.att.com)

The tests all start at the lookup page in the appropriate language - go to the English Lookup Page and click on the language you wish to check.

1. Testing the "Lookup sequence" section.
1. Just click the "Submit" button.
   (This takes a few seconds. All the other tests are very fast.)

   You should get the regular reply, in English, which is

   ID Number: A000055 (Formerly M0791 and N0299)
   Sequence:  1,1,1,1,2,3,6,11,23,47,106,235,551,1301,3159,7741,19320,
              48629,123867,317955,823065,2144505,5623756,14828074,
              39299897,104636890,279793450,751065460,2023443032,
              5469566585,14830871802,40330829030,109972410221
   Name:      Number of trees with n unlabeled nodes.
   ...
   

   but with a header in your language, saying something like
   Greetings from the On-Line Encyclopedia of Integer Sequences!
2. Enter a sequence not in the database, say
   5553446 887756433 122309877
   and click "Submit".

   You should get an error message saying something like this:

   "Sorry, this is not in the database.
   If it is of general interest please send it to me using the Submit web page".

3. Enter just a single digit in that window, say 1, and click "Submit".

   You should get an error message saying something like

   "The sequence must contain at least three digits...."

4. Enter some nonnumeric characters like "%$#&^%^$" in that window, and click "Submit".

   It should complain!

2. Testing the "word" lookup.
   1. Enter a word like Ramanujan, or your name, click the "Word search" radio button, and click Submit

      You should get a list of lines that mention Ramanujan.

   2. Enter a single letter, say e, click the "Word search" and click Submit.

      You should get an error message saying something like

      "The word must contain at least three letters...."

   3. Enter some nonnumeric characters like "%$#&^%^$" in that window, click the "Word search" and click Submit.

      It should complain!

3. Testing the lookup by A-number
   1. Enter the number 12 in the window, click the "A-number" radio button, and click Submit.

      You should get sequence 12. (Don't forget to look at the illustration of the initial terms!)

   2. Enter some nonnumeric characters like "%$#&^%^$" in that window, click the "Word search" and click Submit.

      It should complain!

That's all. If you saw anything wrong, please let me know. Thank you again. Neil Sloane (njas@research.att.com)

Return to Translation page | OEIS lookup page | my home page |

---

---