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.

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

Table of values

n a(n)
1 3
2 5
3 1
4 8
5 2
6 11
7 13
8 4
9 16
10 18
11 6
12 21
13 7
14 24
15 26
16 9
17 29
18 10
19 32
20 34
21 12
22 37
23 39
24 14
25 42
26 15
27 45
28 47
29 17
30 50
31 52
32 19
33 55
34 20
35 58
36 60
37 22
38 63
39 23
40 66
41 68
42 25
43 71
44 73
45 27
46 76
47 28
48 79
49 81
50 30
51 84
52 31
53 87
54 89
55 33
56 92
57 94
58 35
59 97
60 36
61 100
62 102
63 38
64 105

List of values

[3, 5, 1, 8, 2, 11, 13, 4, 16, 18, 6, 21, 7, 24, 26, 9, 29, 10, 32, 34, 12, 37, 39, 14, 42, 15, 45, 47, 17, 50, 52, 19, 55, 20, 58, 60, 22, 63, 23, 66, 68, 25, 71, 73, 27, 76, 28, 79, 81, 30, 84, 31, 87, 89, 33, 92, 94, 35, 97, 36, 100, 102, 38, 105]