cp's OEIS Frontend

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.

A340671 a(n) is the number of values m such that, if the first n positive integers are arranged in alphabetical order in US English, the m-th term in the order is equal to m.

Table of values

n a(n)
1 1
2 2
3 1
4 1
5 0
6 0
7 0
8 1
9 0
10 0
11 2
12 2
13 3
14 2
15 0
16 1
17 0
18 1
19 1
20 1
21 1
22 1
23 2
24 2
25 2
26 1
27 1
28 1
29 2
30 2
31 3
32 1
33 2
34 1
35 2
36 1
37 2
38 1
39 1
40 2
41 2
42 1
43 1
44 2
45 2
46 2
47 2
48 2
49 2
50 0
51 1
52 1
53 2
54 0
55 1
56 0
57 1
58 0
59 1
60 0
61 0
62 0
63 0
64 0
65 0
66 0
67 0
68 0
69 0
70 0
71 0
72 0
73 0
74 0
75 0
76 0
77 0
78 0
79 0
80 0
81 0
82 0
83 0
84 0
85 0
86 0
87 2
88 0
89 1
90 1
91 0
92 0
93 1
94 1
95 2
96 0
97 1
98 0
99 1
100 0

List of values

[1, 2, 1, 1, 0, 0, 0, 1, 0, 0, 2, 2, 3, 2, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 3, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 0, 1, 1, 2, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1, 1, 0, 0, 1, 1, 2, 0, 1, 0, 1, 0]