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.

A379049 a(n) = prime(i)*dp(n,i) + prime(i)*dn(n,i) where dp(n,i) = 1 when the i-th trit of n is 1, dn(n,i) = 1 when the i-th trit of n is T, and dp(n,i) = dn(n,i) = 0 when the i-th trit of n is 0.

Table of values

n a(n)
0 2
1 3
2 5
3 4
4 7
5 11
6 8
7 13
8 7
9 6
10 11
11 17
12 16
13 31
14 37
15 22
16 29
17 17
18 12
19 19
20 31
21 26
22 47
23 13
24 10
25 17
26 9
27 8
28 15
29 23
30 22
31 43
32 41
33 38
34 73
35 37
36 36
37 71
38 107
39 106
40 211
41 221
42 116
43 127
44 81
45 46
46 57
47 103
48 68
49 101
50 53
51 32
52 43
53 25
54 18
55 29
56 47
57 40
58 73
59 97
60 76
61 131
62 69
63 62
64 117

List of values

[2, 3, 5, 4, 7, 11, 8, 13, 7, 6, 11, 17, 16, 31, 37, 22, 29, 17, 12, 19, 31, 26, 47, 13, 10, 17, 9, 8, 15, 23, 22, 43, 41, 38, 73, 37, 36, 71, 107, 106, 211, 221, 116, 127, 81, 46, 57, 103, 68, 101, 53, 32, 43, 25, 18, 29, 47, 40, 73, 97, 76, 131, 69, 62, 117]