A350298 The n-th row of this table is the number of occurrences of letters in the names of integers in US English, in the ranges 1 to 10^n.

0, 0, 0, 0, 9, 2, 1, 2, 4, 0, 0, 0, 0, 5, 3, 0, 0, 2, 2, 4, 1, 2, 1, 1, 0, 0, 0, 0, 0, 2, 148, 51, 20, 41, 91, 0, 0, 2, 0, 90, 39, 0, 0, 41, 40, 137, 11, 31, 20, 20, 80, 0, 1, 0, 0, 1801, 3161, 710, 300, 1501, 1310, 0, 0, 20, 0, 2182, 682, 0, 0, 1500, 601, 1671, 1101, 510, 300, 300, 800, 0

Offset

1,5

Comments

Occurrences are given in alphabetical order. The first data term is occurrences of A, the 26th is occurrences of Z in the range 1 to 10^1 inclusive. The 27th data term is occurrences of A, the 52nd is occurrences of Z in the range 1 to 10^2. This pattern continues.

Links

Michael S. Branicky, Table of n, a(n) for n = 1..156

Example

E occurs once in 1, twice in 3, once in 5, twice in 7, once in 8, once in 9 and once in 10.  This totals 9 occurrences, so a(5)=9.
For ranges from 1 to 10^n (inclusive):
                                  Upper bound of range
   10^1    10^2     10^3      10^4      10^5        10^6
A    0       0        1      9001      99001      999000
B    0       0        0         0          0           0
C    0       0        0         0          0           0
D    0       2     1801     27001     279003     4599000
E    9     148     3161     39601     462002     6320001
F    2      51      710      9100     122000     1420000
G    1      20      300      4000      50000      600000
H    2      41     1501     26001     289002     3999000
I    4      91     1310     17100     222000     2620002
J    0       0        0         0          0           0
K    0       0        0         0          0           0
L    0       2       20       200       4000       40002
M    0       0        0         0          0           1
N    5      90     2182     34802     405003     5359002
O    3      39      682     18801     205002     2359002
P    0       0        0         0          0           0
Q    0       0        0         0          0           0
R    2      41     1500     17000     190001     3000000
S    2      40      601     17001     199001     2199000
T    4     137     1671     28702     403001     4339000
U    1      11     1101     21001     219002     3199000
V    2      31      510      7100      82000     1020000
W    1      20      300      4000      50000      600000
X    1      20      300      4000      50000      600000
Y    0      80      800      8000     160000     1600000
Z    0       0        0         0          0           0

Prog

(Python)
from num2words import num2words
from collections import Counter
def n2w(n): return num2words(n).replace(" and", "")
def row(n):
    c = Counter()
    for i in range(1, 10**n+1): c.update(n2w(i))
    return [c[i] for i in "abcdefghijklmnopqrstuvwxyz"]
print([an for r in range(1, 4) for an in row(r)]) # Michael S. Branicky, Jul 15 2022

Crossrefs

Sequence in context: A319533 A010160 A093962 * A230191 A198984 A118322

Adjacent sequences: A350295 A350296 A350297 * A350299 A350300 A350301

Keyword

nonn,tabf,word

Author

Paul Duckett, Dec 23 2021

Extensions

a(72) and values for T in table for 10^3..10^6 corrected by Michael S. Branicky, Jul 15 2022

Status

approved