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.

A137345 a(n) = binomial( n(n+1)/2, n) mod n.

Table of values

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

List of values

[0, 1, 2, 2, 3, 0, 4, 4, 5, 0, 6, 7, 7, 0, 9, 8, 9, 0, 10, 0, 3, 0, 12, 6, 13, 13, 5, 0, 15, 4, 16, 16, 24, 0, 20, 12, 19, 0, 4, 38, 21, 0, 22, 22, 30, 0, 24, 12, 25, 25, 18, 0, 27, 0, 45, 51, 51, 0, 30, 0, 31, 0, 35, 32, 35, 0, 34, 0, 33, 10, 36, 0, 37, 0, 39, 57, 14, 0, 40, 12, 5, 0, 42, 40]