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.

A212321 Minimal m >= 1 such that floor((2*n-1)!!/m) + 2 is prime.

Table of values

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

List of values

[1, 1, 1, 1, 1, 3, 9, 5, 5, 3, 1, 1, 7, 1, 13, 11, 15, 21, 23, 15, 17, 5, 25, 25, 7, 85, 9, 25, 1, 21, 9, 13, 17, 5, 49, 39, 45, 1, 43, 51, 145, 17, 143, 85, 19, 81, 63, 43, 47, 77, 23, 1, 3, 21, 17, 47, 37, 3, 7, 67, 23, 23, 25, 45, 81, 5, 39, 145, 71, 21, 41]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.