A005589 -id:A005589 - cp's OEIS frontend

A030455 Numbers having the same number of digits as letters in their US English spelling.

1000000000, 2000000000, 6000000000, 3000000000000, 7000000000000, 8000000000000, 10000000000001, 10000000000002, 10000000000006, 10000000000010, 11000000000000, 12000000000000, 20000000000000, 30000000000000, 80000000000000, 90000000000000, 3000000000000000

Offset: 1

Dann Toliver, 1999

Or, numbers N such that A005589(N)=A055642(N).

			"One billion" has 10 letters and "1000000000" has 10 digits.
a(7)=10^13+1 (ten trillion one) has 14 digits and also 14 letters in the US English spelling (while the preferred British spelling is "...and one"). The same applies to a(8)=10^13+2, a(9)=10^13+6, a(10)=10^13+10, a(11)=11*10^12, a(12)=12*10^12, a(13)=20*10^12, a(14)=30*10^12, a(15)=80*10^12, a(16)=90*10^12. - _M. F. Hasler_, Feb 13 2012

L. C. Noll, The English name of a number.
Wiktionary, One hundred one.

See A204593 for the French version.

{N=1; while(1, while(0>d=#Str(N*=10)-A005589(N),);
d | for(k=1,3,print1(k!*N", ")) | next;  for(k=1,90, for(u=0,90, A005589(k*N+u)==#Str(k*N) & print1(k*N+u","))))}

Corrected by M. F. Hasler, Feb 13 2012

A057435 Number of letters in the Turkish name of n, excluding spaces and hyphens.

Original entry on oeis.org

5, 3, 3, 2, 4, 3, 4, 4, 5, 5, 2, 5, 5, 4, 6, 5, 6, 6, 7, 7, 5, 8, 8, 7, 9, 8, 9, 9, 10, 10, 4, 7, 7, 6, 8, 7, 8, 8, 9, 9, 4, 7, 7, 6, 8, 7, 8, 8, 9, 9, 4, 7, 7, 6, 8, 7, 8, 8, 9, 9, 6, 9, 9, 8, 10, 9, 10, 10, 11, 11, 6, 9, 9, 8, 10, 9, 10, 10, 11, 11, 6, 9, 9, 8, 10, 9, 10, 10, 11, 11, 6, 9

Offset: 0

Ozgur Yilmaz (oyilmaz(AT)research.att.com), Sep 08 2000

			a(0) = 5: "sıfır", a(1) = 3: "bir", a(2) = 3: "iki"

Sezai Ata, MATLAB program, 2018.
Index entries for sequences related to number of letters in n

Turkish version of A005589.

MATLAB
```
See Sezai Ata link.
```

a(0) = 5 prepended by Sezai Ata, May 25 2018

A102082 Number of times the n-th letter in an infinitely repeating English alphabet appears in the US English name for the number n.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 3, 1, 1, 1

Offset: 0

Jeremy Ballard (gtg056b(AT)prism.gatech.edu), Feb 13 2005

			a(5) = 1 since letter 5 = e appears once in "five".
a(20) = 2 since letter 20 = t appears twice in "twenty".
a(34) = 1 since letter 34 = h appears once in "thirty four".
a(105) = 0 since letter 105 = a does not appear in "one hundred five".
a,b,c,... z, a, b, ... .
1,2,3,...26,27,28, ... .

Michael S. Branicky, Table of n, a(n) for n = 0..10000

Cf. A005589, A072959.

from num2words import num2words
def a(n): return num2words(n).replace(" and", "").count(chr(96+n%26))
print([a(n) for n in range(87)]) # Michael S. Branicky, Jul 15 2022

Name clarified, a(0) inserted, and a(34) and beyond from Michael S. Branicky, Jul 15 2022

A119960 Positive integers with prime number of characters in their English names, including spaces and hyphens.

Original entry on oeis.org

1, 2, 3, 6, 7, 8, 10, 15, 16, 24, 25, 29, 34, 35, 39, 40, 43, 47, 48, 50, 53, 57, 58, 60, 63, 67, 68, 70, 71, 72, 73, 76, 77, 78, 84, 85, 89, 94, 95, 99

Offset: 1

Jonathan Vos Post, Aug 02 2006

Differs due to hyphens and spaces from A072685 Positive integers whose English names contain a prime number of letters. Primes with prime number of characters in their English names, including spaces and hyphens, are a subset of this beginning: 2, 3, 7, 29, 43, 47, 53, 67, 71, 73.

Cf. A000040, A052360, A005589, A052362-A052363, A072685.

Select[Range[99], PrimeQ[ StringLength@ IntegerName[#, "Words"]] &] (* Giovanni Resta, Jun 13 2016 *)

n such that A052360(n) is prime. n such that A052360(n) is in A000040.

Missing a(1) and more terms from Giovanni Resta, Jun 13 2016

A124060 T totaler sequence. Number of t's in the American spelling of numbers.

Original entry on oeis.org

0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 2, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 2, 2, 3, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1

Offset: 0

Cino Hilliard, Nov 03 2006

			The words "zero" and "one" have no t's, so a(0) = a(1) = 0.
The words "two" and "three" each have one t, so a(2) = a(3) = 1.

Michael S. Branicky, Table of n, a(n) for n = 0..10000

Cf. A005589, A008522.

total(n) = { local(a,i,j,sumt); a=["zero","one","two","three","four","five","six","seven","eight","nine","ten", "eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen", "eghteen","nineteen","twenty","twentyone","twentytwo","twentythree", "twentyfour","twentyfive","twentysix","twentyseven","twentyeight","twentynine", "thirty","thirtyone","thirtytwo","thirtythree","thirtyfour","thirtyfive", "thirtysix","thirtyseven","thirtyeight","thirtynine","forty","fortyone", "fortytwo","fortythree","fortyfour","fortyfive","fortysix","fortyseven", "fortyeight","fortynine","fifty"]; for(i = 1,n, sumt=0; for(j=1,length(a[i]), if(mid(a[i],j,1)=="t",sumt++) ); print1(sumt, ", ") ) }
\\ Get a substring of length n from string str starting at position s in str.
mid(str,s,n) =  { local(v,ln,x,tmp); v =""; tmp = Vec(str); ln=length(tmp); for(x=s,s+n-1, v=concat(v,tmp[x]); ); return(v) }

from num2words import num2words
def a(n): return num2words(n).count('t')
print([a(n) for n in range(87)]) # Michael S. Branicky, Nov 25 2021

Offset corrected by Jon E. Schoenfield, Nov 23 2021

a(51) and beyond from Michael S. Branicky, Nov 25 2021

A132984 Number of letters in n (in Latin).

Original entry on oeis.org

4, 3, 4, 8, 7, 3, 6, 4, 5, 5, 7, 8, 8, 13, 9, 7, 11, 12, 11, 7, 11, 10, 11, 15, 14, 10, 13, 13, 12, 8, 12, 11, 12, 16, 15, 11, 14, 16, 15, 11, 15, 14, 15, 19, 18, 14, 17, 17, 16, 12, 16, 15, 16, 20, 19, 15, 18, 14, 13, 9, 13, 12, 13, 17, 16, 12, 15, 16, 15, 11, 15, 14, 15, 19, 18, 14, 17, 14, 13, 9, 13, 12, 13, 17, 16, 12, 15, 14, 13, 9, 13, 12, 13, 17, 16, 12, 15, 11, 10, 6

Offset: 1

N. J. A. Sloane, Nov 20 2007

Does not count spaces as letters.

Wheelock (see the Pavur link): "Note that the declinable forms are not indicated here (e.g. words ending with unus, duo, tres and the designations for two to nine hundred, like ducenti, trecenti, etc.). Also, some alternate forms do not appear (e.g. undecentum for ninety-nine)."

			Latin words for the numbers are: unus, duo, tres, quattuor, quinque, sex, septem, octo, novem, decem, undecim, duodecim, tredecim, quattuordecim, quindecim, sedecim, septendecim, duodeviginti, undeviginti, viginti, viginti unus, viginti duo, viginti tres, viginti quattuor, viginti quinque, viginti sex, viginti septem, duodetriginta, undetriginta, triginta, triginta unus, triginta duo, triginta tres, triginta quattuor, triginta quinque, triginta sex, triginta septem, duodequadraginta, undequadraginta, quadraginta, quadraginta unus, quadraginta duo, quadraginta tres, quadraginta quattuor, quadraginta quinque, quadraginta sex, quadraginta septem, duodequinquaginta, undequinquaginta, quinquaginta, ...

Jessie Gietl, Brush up on your Latin
Claude Pavur, Latin Number Practice, From Latin Names, Latin Teaching Materials at Saint Louis University, 2006.
Transparent Language, Latin Numbers 1-100
Index entries for sequences related to number of letters in n

Cf. A005589. See the Index to the OEIS under "letters in n" for other languages.

Edited, corrected and extended by Jonathan Vos Post, Nov 21 2007

a(48) inserted and a(51)..a(100) from Michael S. Branicky, Jun 08 2022

A164058 Number of curves in n-th letter of capitalized English alphabet (A being first).

Original entry on oeis.org

0, 2, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0

Offset: 1

Jonathan Vos Post, Aug 08 2009

"Curve" as was excluded from sums in A163828. Curves are classified as: circle as occurs in {O, Q}, semicircle as in {B (twice), C, D, G, J, P, R, U}, and other {S}. We do not consider "S" as two semicircles, nor make various approximations of curves as sequences of line segments (as in A002963). In conjunction with A163828, we may sum the number of curves and straight line segments in an English magiscule (capital) letter, and thus derive an integer total of the number of straight and curved segments in the spelled-out English name of any nonnegative integer.

			a(2) = 2 because of the two semicircles in the 2nd letter, B. a(k) = 0 for k = {the letters occurring in A163670} = {A, E, F, H, I, K, L, M, N, T, V, W, X, Y, Z}.

Cf. A002963, A005589, A163670, A163828.

A164059 Number of straight plus curved segments in the capitalized English name of n.

Original entry on oeis.org

11, 8, 7, 16, 8, 10, 4, 14, 13, 11, 9, 19, 18, 22, 21, 20, 17, 27, 24, 24, 18, 26, 25, 34, 26, 28, 22, 32, 31, 29, 14, 22, 21, 30, 22, 24, 18, 28, 27, 25, 12, 20, 19, 28, 20, 22, 16, 26, 25, 23, 12, 20, 19, 28, 20, 22, 16, 26, 25, 23, 9, 17, 16, 25, 17, 19, 13, 23, 22, 20, 19

Offset: 0

Jonathan Vos Post, Aug 08 2009

Number of straight plus curved segments in all letters of the name of n, excluding hyphens.

			a(0) = 11 because ZERO has (letter by letter) 3+4+2+0 = 9 straight line segments (chisel strokes) and 0+0+1+1 = 2 curves as in A164058, with 9 + 2 = 11.
a(1) = 8 because of 1 curve in O, plus 3 chisel strokes in N and 4 chisel strokes in E, summing to 8 segments (straight or curved) in ONE.

Cf. A002963, A005589, A163670, A163828, A164058.

names :=["zero", "one", "two", "three", "four", "five", "six", "seven", "eight",
"nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen",
"seventeen", "eighteen", "nineteen", "twenty", "twentyone", "twentytwo", "twentythree",
"twentyfour", "twentyfive", "twentysix", "twentyseven", "twentyeight", "twentynine", "thirty",
"thirtyone", "thirtytwo", "thirtythree", "thirtyfour", "thirtyfive", "thirtysix",
"thirtyseven", "thirtyeight", "thirtynine", "forty", "fortyone", "fortytwo",
"fortythree", "fortyfour", "fortyfive", "fortysix", "fortyseven", "fortyeight",
"fortynine", "fifty", "fiftyone", "fiftytwo", "fiftythree", "fiftyfour",
"fiftyfive", "fiftysix", "fiftyseven", "fiftyeight", "fiftynine", "sixty",
"sixtyone", "sixtytwo", "sixtythree", "sixtyfour", "sixtyfive", "sixtysix",
"sixtyseven", "sixtyeight", "sixtynine", "seventy", "seventyone", "seventytwo",
"seventythree", "seventyfour", "seventyfive", "seventysix", "seventyseven",
"seventyeight", "seventynine", "eighty", "eightyone", "eightytwo", "eightythree",
"eightyfour", "eightyfive", "eightysix", "eightyseven", "eightyeight", "eightynine",
"ninety", "ninetyone", "ninetytwo", "ninetythree", "ninetyfour", "ninetyfive",
"ninetysix", "ninetyseven", "ninetyeight", "ninetynine", "onehundred"] :
cstrok := [ 3, 1, 0, 1, 4, 3, 2, 3, 1, 1, 3, 2, 4, 3, 0, 1, 1, 2, 0, 2, 0, 2, 4, 2, 3, 3 ] ;
A164058 := [ 0, 2, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0] ;
A164059 := proc(n) global names, cstrok, A164058; local a,idx ; a := 0 ; for c in StringTools[Explode]( names[n+1]) do idx := StringTools[Ord](c)-96 ; a := a+ cstrok[idx]+A164058[idx] ; od: a ; end:
seq(A164059(n),n=0..70) ; # R. J. Mathar, Sep 29 2009

a(n) = A163828(n) + (number of curves in the letters of the English name of n as in A164058).

a(n) = A163828(n) for n in A163670.

More terms from R. J. Mathar, Sep 29 2009

A211408 Numbers k such that the number of letters, excluding spaces and hyphens, in the English names of k and its reversal are the same.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 22, 33, 34, 35, 38, 41, 43, 44, 45, 48, 53, 54, 55, 58, 66, 67, 69, 76, 77, 79, 83, 84, 85, 88, 96, 97, 99, 101, 102, 103, 104, 105, 106, 107, 108, 109, 111, 112, 113, 115, 118, 121, 122, 123, 124, 125, 126, 127, 128, 129

Offset: 0

Jonathan Vos Post, Feb 09 2013

All base-10 palindromes occur in this sequence.

			10 is in the sequence because "ten" has three letters, and so does "one" which is the name of the digital reverse of 10, which is 1 (because the leading 0 is truncated in 01).
14 is in the sequence because "fourteen" and "fortyone" both have 8 letters.

Robert G. Wilson v, Table of n, a(n) for n = 0..23885

Subsequences: A002113.

Cf. A000027, A004086, A005589, A107322.

lst= {(* copy the words from https://oeis.org/A000027/a000027.txt *)}; f[n_] := StringLength@ ToString@ lst[[n + 1]]; fQ[n_] := f@ n == f@ FromDigits@ Reverse@ IntegerDigits@ n; Select[Range[0, 130], fQ] (* Robert G. Wilson v, Feb 12 2013 *)

{n such that A005589(n) = A005589(A004086(n))}.

Corrected and extended by Robert G. Wilson v, Feb 12 2013

A242898 Cumulative number of letters in decimal expansion of Pi being spoken in English as "Three Point One Four One...".

Original entry on oeis.org

5, 10, 13, 17, 20, 24, 28, 31, 34, 38, 43, 47, 52, 56, 61, 65, 70, 73, 78, 83, 87, 90, 93, 96, 100, 105, 110, 115, 120, 123, 128, 132, 136, 140, 143, 148, 153, 157, 160, 164, 169, 172, 175, 179, 184, 188, 192, 197, 202, 206, 209, 213, 217, 222, 225, 229, 233

Offset: 1

Jonathan Vos Post, May 25 2014

			a(1) = 5 because "Three" has five letters;
a(2) = 10 because "Three Point" has ten letters;
a(3) = 13 because "Three Point One" has thirteen letters.

Cf. A000796, A005589, A052384, A107488.

A242898 := proc(n)
    5+add(A052384(i),i=1..n-1) ;
end proc:
seq(A242898(n),n=1..57) ; # R. J. Mathar, Jun 30 2020

a(n) = 5 + SUM[i=1..n-1] A005589(A000796(i)).

a(n) = 5 + SUM[i=1..n-1] A107488(i).

cp's OEIS Frontend

A030455 Numbers having the same number of digits as letters in their US English spelling.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A057435 Number of letters in the Turkish name of n, excluding spaces and hyphens.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

MATLAB

Extensions

A102082 Number of times the n-th letter in an infinitely repeating English alphabet appears in the US English name for the number n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

Extensions

A119960 Positive integers with prime number of characters in their English names, including spaces and hyphens.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

Extensions

A124060 T totaler sequence. Number of t's in the American spelling of numbers.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

Python

Extensions

A132984 Number of letters in n (in Latin).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A164058 Number of curves in n-th letter of capitalized English alphabet (A being first).

Views

Author

Keywords

Comments

Examples

Crossrefs

A164059 Number of straight plus curved segments in the capitalized English name of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Formula

Extensions