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.

A013585 Smallest m such that 1!+...+m! is divisible by 2n+1, or 0 if no such m exists.

Table of values

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

List of values

[1, 2, 0, 0, 3, 4, 0, 0, 5, 0, 0, 12, 0, 7, 19, 0, 4, 0, 24, 0, 32, 19, 0, 0, 0, 5, 20, 0, 0, 0, 0, 0, 0, 20, 12, 0, 7, 0, 0, 57, 7, 0, 0, 19, 0, 0, 0, 0, 6, 8, 83, 0, 0, 15, 33, 24, 0, 0, 0, 0, 12, 32, 0, 38, 19, 9, 0, 0, 0, 23, 0, 0, 0, 0, 70, 71, 5, 0, 57, 20, 0, 17, 0, 0, 0, 0, 26, 0, 0, 0, 0, 0, 0, 0, 0, 28]