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.

A338191 a(1) = 1, a(n) is the least m not already in a(n) such that m mod 10 = decimal digital root of a(n - 1).

Table of values

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

List of values

[1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7, 17, 8, 18, 9, 19, 21, 23, 25, 27, 29, 22, 24, 26, 28, 31, 34, 37, 41, 35, 38, 32, 45, 39, 33, 36, 49, 44, 48, 43, 47, 42, 46, 51, 56, 52, 57, 53, 58, 54, 59, 55, 61, 67, 64, 71, 68, 65, 62, 78, 66, 63, 69, 76, 74, 72]