OFFSET
1,1
COMMENTS
To decode the sequence, start by replacing the last two digits of a term by a letter of the English alphabet (01=A, 02=B, 03=C, 04=D, ... 26=Z); one gets for the first 11 terms 1A,1B,4O,5O,5E,5F,8E,5V,1C,4N,8F,... Now replace the remaining numbers by their English name: ONE A, ONE B, FOUR O, FIVE O, FIVE E, FIVE F, EIGHT E, FIVE V, ONE C, FOUR N, EIGHT F,... This succession of words is the alphabetically first one describing, step by step, the true state of the list so far.
In the first 100000 terms of ONE A, ONE B, FOUR O,..., no term ever starts with T and only one term (#13886) starts with S: SIXTY-FIVE THOUSAND TWENTY-SEVEN E. - Hans Havermann, Apr 14 2016
REFERENCES
This sequence was mentioned for the first time on the math-fun forum on April 10th.
LINKS
Jean-Marc Falcoz, Table of n, a(n) for n = 1..96
Hans Havermann, Table of 1 A, 1 B, 4 O,... for a very large number of terms
CROSSREFS
KEYWORD
nonn,base,word
AUTHOR
Eric Angelini and Hans Havermann, Apr 11 2016
STATUS
approved