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.

A328625 In primorial base representation of n, multiply all other digits except the least significant with 1+{their right hand side neighbor}, and reduce each modulo prime(k) (with k > 1) to get a new digit for the position k (the least significant digit stays as it is), then convert back to decimal.

Table of values

n a(n)
0 0
1 1
2 2
3 5
4 4
5 3
6 6
7 7
8 14
9 17
10 22
11 21
12 12
13 13
14 26
15 29
16 10
17 9
18 18
19 19
20 8
21 11
22 28
23 27
24 24
25 25
26 20
27 23
28 16
29 15
30 30
31 31
32 32
33 35
34 34
35 33
36 66
37 67
38 74
39 77
40 82
41 81
42 102
43 103
44 116
45 119
46 100
47 99
48 138
49 139
50 128
51 131
52 148
53 147
54 174
55 175
56 170
57 173
58 166
59 165
60 60
61 61
62 62
63 65
64 64
65 63
66 126
67 127
68 134
69 137
70 142
71 141
72 192
73 193
74 206
75 209
76 190
77 189
78 48
79 49
80 38
81 41
82 58
83 57
84 114

List of values

[0, 1, 2, 5, 4, 3, 6, 7, 14, 17, 22, 21, 12, 13, 26, 29, 10, 9, 18, 19, 8, 11, 28, 27, 24, 25, 20, 23, 16, 15, 30, 31, 32, 35, 34, 33, 66, 67, 74, 77, 82, 81, 102, 103, 116, 119, 100, 99, 138, 139, 128, 131, 148, 147, 174, 175, 170, 173, 166, 165, 60, 61, 62, 65, 64, 63, 126, 127, 134, 137, 142, 141, 192, 193, 206, 209, 190, 189, 48, 49, 38, 41, 58, 57, 114]