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.

A342369 If n is congruent to 2 (mod 3), then a(n) = (2*n - 1)/3; otherwise, a(n) = 2*n.

Table of values

n a(n)
0 0
1 2
2 1
3 6
4 8
5 3
6 12
7 14
8 5
9 18
10 20
11 7
12 24
13 26
14 9
15 30
16 32
17 11
18 36
19 38
20 13
21 42
22 44
23 15
24 48
25 50
26 17
27 54
28 56
29 19
30 60
31 62
32 21
33 66
34 68
35 23
36 72
37 74
38 25
39 78
40 80
41 27
42 84
43 86
44 29
45 90
46 92
47 31
48 96
49 98
50 33
51 102
52 104
53 35
54 108
55 110
56 37
57 114
58 116
59 39
60 120
61 122
62 41
63 126
64 128
65 43
66 132
67 134
68 45
69 138
70 140
71 47
72 144
73 146

List of values

[0, 2, 1, 6, 8, 3, 12, 14, 5, 18, 20, 7, 24, 26, 9, 30, 32, 11, 36, 38, 13, 42, 44, 15, 48, 50, 17, 54, 56, 19, 60, 62, 21, 66, 68, 23, 72, 74, 25, 78, 80, 27, 84, 86, 29, 90, 92, 31, 96, 98, 33, 102, 104, 35, 108, 110, 37, 114, 116, 39, 120, 122, 41, 126, 128, 43, 132, 134, 45, 138, 140, 47, 144, 146]