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.

A179820 a(n) = n-th triangular number mod (n+2).

Table of values

n a(n)
0 0
1 1
2 3
3 1
4 4
5 1
6 5
7 1
8 6
9 1
10 7
11 1
12 8
13 1
14 9
15 1
16 10
17 1
18 11
19 1
20 12
21 1
22 13
23 1
24 14
25 1
26 15
27 1
28 16
29 1
30 17
31 1
32 18
33 1
34 19
35 1
36 20
37 1
38 21
39 1
40 22
41 1
42 23
43 1
44 24
45 1
46 25
47 1
48 26
49 1
50 27
51 1
52 28
53 1
54 29
55 1
56 30
57 1
58 31
59 1
60 32
61 1
62 33
63 1
64 34
65 1
66 35
67 1
68 36
69 1
70 37
71 1
72 38
73 1
74 39
75 1
76 40
77 1
78 41
79 1
80 42
81 1
82 43
83 1
84 44
85 1
86 45

List of values

[0, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 1, 10, 1, 11, 1, 12, 1, 13, 1, 14, 1, 15, 1, 16, 1, 17, 1, 18, 1, 19, 1, 20, 1, 21, 1, 22, 1, 23, 1, 24, 1, 25, 1, 26, 1, 27, 1, 28, 1, 29, 1, 30, 1, 31, 1, 32, 1, 33, 1, 34, 1, 35, 1, 36, 1, 37, 1, 38, 1, 39, 1, 40, 1, 41, 1, 42, 1, 43, 1, 44, 1, 45]