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.

A364935 a(1) = 1 and thereafter a(n) = sum of digits of the number from concatenation of a(n-1) on the left with leftmost digit of a(n-1) + k and concatenation on the right with rightmost digit of a(n-1) + k, where k is the number of times a(n-1) has appeared in the sequence.

Table of values

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

List of values

[1, 5, 17, 18, 20, 6, 20, 8, 26, 18, 13, 10, 4, 14, 12, 8, 10, 6, 22, 10, 8, 12, 10, 10, 12, 12, 14, 14, 16, 16, 18, 15, 14, 18, 17, 20, 10, 14, 20, 12, 16, 20, 14, 13, 12, 18, 19, 13, 14, 15, 16, 13, 16, 15, 18, 21, 8, 14, 17, 13, 18, 23, 12, 20, 16, 17, 15, 20, 18, 25, 16, 19, 15, 13]