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.

A340138 a(1)=0, a(n+1) = the least m not already in the sequence such that the decimal digital root r of a(n-1) is found somewhere among the decimal digits of m.

Table of values

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

List of values

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