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.

A081394 a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A001405(k) = C(k, floor(k/2)) equals n.

Table of values

n a(n)
0 1
1 6
2 10
3 27
4 96
5 147
6 363
7 627
8 959
9 1547
10 1919
11 2641
12 2645
13 3339
14 6241
15 6909
16 6913
17 6943
18 6923
19 6937
20 16405
21 19981
22 24325
23 31675
24 31679
25 35329
26 36959
27 36963
28 38915
29 38927
30 73563
31 39729
32 73577
33 80095
34 87205
35 87309
36 95035
37 123307
38 123305
39 123369
40 123367
41 174239
42 185915
43 186361
44 186369
45 186373
46 186381

List of values

[1, 6, 10, 27, 96, 147, 363, 627, 959, 1547, 1919, 2641, 2645, 3339, 6241, 6909, 6913, 6943, 6923, 6937, 16405, 19981, 24325, 31675, 31679, 35329, 36959, 36963, 38915, 38927, 73563, 39729, 73577, 80095, 87205, 87309, 95035, 123307, 123305, 123369, 123367, 174239, 185915, 186361, 186369, 186373, 186381]