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.

A335497 a(1) = 1, and for any n > 0, a(n+1) is the number of times the decimal representation of a(n) appears in the concatenation of the first n terms, possibly with overlap.

Table of values

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

List of values

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