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.

A276457 a(n) is the number of times that a(n-1) appears in the concatenation of all numbers from a(0) to a(n-2), with a(0) = 0.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8, 0, 9, 0, 10, 1, 2, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 1, 10, 2, 2, 3, 2, 4, 2, 5, 2, 6, 2, 7, 2, 8, 2, 9, 2, 10, 3, 3, 4, 3, 5, 3, 6, 3, 7, 3, 8, 3, 9, 3, 10, 4, 4, 5, 4, 6, 4, 7, 4, 8, 4, 9, 4, 10, 5, 5, 6, 5, 7, 5, 8, 5, 9, 5, 10, 6, 6, 7, 6, 8, 6, 9, 6, 10, 7, 7, 8, 7, 9, 7, 10]