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.

A118562 Least number k such that binomial(2k,k) is divisible by all squares to n squared but not (n+1) squared, or 0 if impossible.

Table of values

n a(n)
1 1
2 3
3 5
4 15
5 0
6 23
7 89
8 95
9 0
10 123
11 0
12 215
13 0
14 0
15 1117
16 943
17 0
18 2003
19 0
20 0
21 0
22 3455
23 0
24 1439
25 0
26 7846
27 0
28 7916
29 0
30 14735
31 13103
32 0
33 0
34 0
35 0
36 23711
37 0
38 0
39 0
40 24049
41 0
42 44857
43 0
44 0
45 0
46 44711
47 0
48 47594
49 0
50 0
51 0
52 77021
53 0
54 0
55 0
56 0
57 0
58 195765
59 0
60 381398
61 0
62 0
63 374435
64 0
65 0

List of values

[1, 3, 5, 15, 0, 23, 89, 95, 0, 123, 0, 215, 0, 0, 1117, 943, 0, 2003, 0, 0, 0, 3455, 0, 1439, 0, 7846, 0, 7916, 0, 14735, 13103, 0, 0, 0, 0, 23711, 0, 0, 0, 24049, 0, 44857, 0, 0, 0, 44711, 0, 47594, 0, 0, 0, 77021, 0, 0, 0, 0, 0, 195765, 0, 381398, 0, 0, 374435, 0, 0]