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.

A273943 Put and say how often: a(n) = n/2 if n is even, else a(n) = number of matches of "a(n-1)" in the concatenation of all "a(i)" with i < n, where "x" denotes the decimal string of x.

Table of values

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

List of values

[0, 1, 1, 2, 2, 2, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 1, 10, 1, 11, 4, 12, 2, 13, 1, 14, 3, 15, 2, 16, 2, 17, 2, 18, 2, 19, 2, 20, 1, 21, 6, 22, 5, 23, 2, 24, 1, 25, 2, 26, 1, 27, 1, 28, 1, 29, 1, 30, 1, 31, 4, 32, 2, 33, 1, 34, 1, 35, 1, 36, 1, 37, 1, 38, 1, 39, 1, 40, 1, 41, 5, 42, 1, 43, 3, 44, 1, 45, 1, 46, 1, 47, 1, 48, 1, 49, 1, 50, 1, 51, 4, 52, 4, 53, 1, 54, 2]