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.

A367065 a(1)=2, thereafter a(n) is the least positive integer not yet in the sequence such that Sum_{i=1..n} a(i) == 2 (mod n+2).

Table of values

n a(n)
1 2
2 4
3 1
4 7
5 9
6 3
7 12
8 14
9 5
10 17
11 6
12 20
13 22
14 8
15 25
16 27
17 10
18 30
19 11
20 33
21 35
22 13
23 38
24 40
25 15
26 43
27 16
28 46
29 48
30 18
31 51
32 19
33 54
34 56
35 21
36 59
37 61
38 23
39 64
40 24
41 67
42 69
43 26
44 72
45 74
46 28
47 77
48 29
49 80
50 82
51 31
52 85
53 32
54 88
55 90
56 34
57 93
58 95
59 36
60 98
61 37
62 101
63 103
64 39
65 106
66 108
67 41
68 111
69 42
70 114

List of values

[2, 4, 1, 7, 9, 3, 12, 14, 5, 17, 6, 20, 22, 8, 25, 27, 10, 30, 11, 33, 35, 13, 38, 40, 15, 43, 16, 46, 48, 18, 51, 19, 54, 56, 21, 59, 61, 23, 64, 24, 67, 69, 26, 72, 74, 28, 77, 29, 80, 82, 31, 85, 32, 88, 90, 34, 93, 95, 36, 98, 37, 101, 103, 39, 106, 108, 41, 111, 42, 114]