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.

A217467 a(1) = 1; for n > 1, the maximum exponent k such that n^k divides the double factorial n!!.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 2, 2, 1, 1, 5, 2, 1, 2, 2, 1, 3, 1, 6, 2, 1, 3, 4, 1, 1, 2, 4, 1, 3, 1, 2, 6, 1, 1, 10, 2, 3, 2, 2, 1, 4, 3, 4, 2, 1, 1, 7, 1, 1, 6, 10, 3, 3, 1, 2, 2, 5, 1, 8, 1, 1, 5, 2, 4, 3, 1, 9, 5, 1, 1, 6, 3, 1]