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.

A081393 a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A000984(k) = C(2*k,k) equals n.

Table of values

n a(n)
0 1
1 3
2 5
3 14
4 48
5 74
6 182
7 314
8 480
9 774
10 960
11 1321
12 1323
13 1670
14 3121
15 3455
16 3457
17 3472
18 3462
19 3469
20 8203
21 9991
22 12163
23 15838
24 15840
25 17665
26 18480
27 18482
28 19458
29 19464
30 36782
31 19865
32 36789
33 40048
34 43603
35 43655
36 47518
37 61654
38 61653
39 61685
40 61684
41 87120
42 92958
43 93181
44 93185
45 93187
46 93191

List of values

[1, 3, 5, 14, 48, 74, 182, 314, 480, 774, 960, 1321, 1323, 1670, 3121, 3455, 3457, 3472, 3462, 3469, 8203, 9991, 12163, 15838, 15840, 17665, 18480, 18482, 19458, 19464, 36782, 19865, 36789, 40048, 43603, 43655, 47518, 61654, 61653, 61685, 61684, 87120, 92958, 93181, 93185, 93187, 93191]