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.

A358851 a(n+1) is the number of occurrences of the largest digit of a(n) among all the digits of [a(0), a(1), ..., a(n)], with a(0)=0.

Table of values

n a(n)
0 0
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 11
21 13
22 2
23 2
24 3
25 3
26 4
27 2
28 4
29 3
30 5
31 2
32 5
33 3
34 6
35 2
36 6
37 3
38 7
39 2
40 7
41 3
42 8
43 2
44 8
45 3
46 9
47 2
48 9
49 3
50 10
51 15
52 4
53 4
54 5
55 5
56 6
57 4
58 6
59 5
60 7
61 4
62 7
63 5
64 8
65 4
66 8
67 5
68 9
69 4
70 9
71 5
72 10
73 17
74 6
75 6
76 7
77 7
78 8
79 6

List of values

[0, 1, 1, 2, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 1, 10, 11, 13, 2, 2, 3, 3, 4, 2, 4, 3, 5, 2, 5, 3, 6, 2, 6, 3, 7, 2, 7, 3, 8, 2, 8, 3, 9, 2, 9, 3, 10, 15, 4, 4, 5, 5, 6, 4, 6, 5, 7, 4, 7, 5, 8, 4, 8, 5, 9, 4, 9, 5, 10, 17, 6, 6, 7, 7, 8, 6]