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.

A341162 Computing a(n) modulo (digit sum of a(n)) for the successive terms of the sequence results in a sequence that has the same succession of digits as this one.

Table of values

n a(n)
1 11
2 13
3 17
4 15
5 41
6 29
7 43
8 38
9 14
10 56
11 16
12 19
13 25
14 23
15 31
16 28
17 91
18 44
19 53
20 34
21 97
22 46
23 101
24 57
25 22
26 55
27 26
28 33
29 35
30 68
31 74
32 69
33 106
34 64
35 89
36 61
37 39
38 47
39 92
40 93
41 37
42 104
43 58
44 49
45 79
46 71
47 32
48 67
49 124
50 125
51 82
52 62
53 51
54 52
55 59
56 137
57 66
58 88
59 77
60 116
61 83
62 99
63 65
64 96
65 134
66 151
67 118
68 109
69 136
70 98
71 119
72 154
73 85
74 129
75 86

List of values

[11, 13, 17, 15, 41, 29, 43, 38, 14, 56, 16, 19, 25, 23, 31, 28, 91, 44, 53, 34, 97, 46, 101, 57, 22, 55, 26, 33, 35, 68, 74, 69, 106, 64, 89, 61, 39, 47, 92, 93, 37, 104, 58, 49, 79, 71, 32, 67, 124, 125, 82, 62, 51, 52, 59, 137, 66, 88, 77, 116, 83, 99, 65, 96, 134, 151, 118, 109, 136, 98, 119, 154, 85, 129, 86]