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!)
A052363 Numbers n whose English name has a greater length (A005589) than any smaller number. 11

%I #32 Apr 25 2023 03:33:45

%S 0,3,11,13,17,23,73,101,103,111,113,117,123,173,323,373,1103,1111,

%T 1113,1117,1123,1173,1323,1373,3323,3373,11373,13323,13373,17373,

%U 23323,23373,73373,101373,103323,103373,111373,113323,113373,117373,123323,123373,173373,323373,373373

%N Numbers n whose English name has a greater length (A005589) than any smaller number.

%C Indices of records in A005589 (which only counts letters, but not spaces and punctuation, in the English name of numbers).

%H Michael S. Branicky, <a href="/A052363/b052363.txt">Table of n, a(n) for n = 1..597</a> (terms < 10^54)

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Number.html">Number</a>

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LargeNumber.html">Large Number</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Names_of_large_numbers">Names of Large Numbers</a>

%H Wiktionary, <a href="https://en.wiktionary.org/wiki/one_hundred_one">one hundred one</a> (US)

%H Wiktionary, <a href="https://en.wiktionary.org/wiki/one_hundred_and_one">one hundred and one</a> (UK)

%H Robert G. Wilson v, <a href="https://oeis.org/A001477/a001477.txt">American English names for the numbers from 0 to 100999 without spaces or hyphens</a>

%e Note that A052360(373373) = 64 and A005589(373373) = 56.

%e Sequence A052362 uses A052360 which also counts spaces and dashes, therefore "twenty-one" is in that sequence but not in this one: it uses one more character ('-') but has the same number of letters than "seventeen". - _M. F. Hasler_, Aug 12 2020

%o (PARI) m=0; for(n=0, 2e6, if(m<A005589(n), m=A005589(n); print1(n", "))) \\ _M. F. Hasler_, Aug 12 2020

%o (Python)

%o from itertools import count, islice

%o from num2words import num2words as n2w

%o def f(n): return sum(1 for c in n2w(n).replace(" and", "") if c.isalpha())

%o def agen():

%o record = 0

%o for n in count(0):

%o value = f(n)

%o if value > record: yield n; record = value

%o n += 1

%o print(list(islice(agen(), 40))) # _Michael S. Branicky_, Jul 12 2022

%Y Cf. A005589, A052360, A052362.

%K nonn,word

%O 1,2

%A _Allan C. Wechsler_, Mar 07 2000

%E Edited by _R. J. Mathar_ and _T. D. Noe_, Apr 09 2009

%E Minor edits by _Ray Chandler_, Jul 22 2009

%E a(41) and beyond from _Michael S. Branicky_, Jul 12 2022

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 May 1 08:06 EDT 2024. Contains 372149 sequences. (Running on oeis4.)