login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 5

%I #9 Jan 02 2023 12:30:49

%S 5,9,16,26,35,40,49,59,66,76,86,95,109,129,149,166,186,200,209,229,

%T 249,266,286,300,316,339,359,380,399,418,439,459,480,496,510,530,546,

%U 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 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 See A233185-A233188 for French and German variants.

%H E. Angelini, <a href="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 (PARI) a=0;k=0;for(n=1,99,until( k++ > a + A005589(k),); print1(k,","); a+=A005589(k))

%K nonn,word

%O 1,1

%A _Eric Angelini_ and _M. F. Hasler_, Dec 05 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)