This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A233184 #10 Dec 23 2024 14:53:43 %S A233184 5,9,16,26,35,40,49,59,66,76,86,95,109,129,149,166,186,200,209,229, %T A233184 249,266,286,300,316,339,359,380,399,418,439,459,480,496,510,530,546, %U A233184 566,586,600,609,629,649,666,686,700,716,739,759,780,799,819,840,856,879,900,905,926,945,965,986,1000,1010,1030,1046,1066,1086,1110 %N A233184 a(n) is the least number larger than the total number of letters in the English names for all terms up to and including a(n). %C A233184 See A233185-A233188 for French and German variants. %H A233184 E. Angelini, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2013-December/012058.html">Cumulative quantity of letters used in a list of English number-names</a>, SeqFan list, Dec 05 2013 %o A233184 (PARI) a=0;k=0;for(n=1,99,until( k++ > a + A005589(k),); print1(k,","); a+=A005589(k)) %K A233184 nonn,word %O A233184 1,1 %A A233184 _Eric Angelini_ and _M. F. Hasler_, Dec 05 2013