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.

A343533 a(n) is the largest value of k such that binomial(2*m-1, m-1) == 1 (mod m^k) for m = 2*n + 1.

Table of values

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

List of values

[2, 3, 3, 1, 3, 3, 0, 3, 3, 0, 3, 1, 0, 3, 3, 0, 0, 3, 0, 3, 3, 0, 3, 1, 0, 3, 0, 0, 3, 3, 0, 0, 3, 0, 3, 3, 0, 0, 3, 0, 3, 0, 0, 3, 0, 0, 0, 3, 0, 3, 3, 0, 3, 3, 0, 3, 0, 0, 0, 1, 0, 1, 3, 0, 3, 0, 0, 3, 3, 0, 0, 0, 0, 3, 3, 0, 0, 3, 0, 0, 3, 0, 3, 1, 0, 3, 0]